Results 51 to 60 of about 85,558 (251)
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation [PDF]
Logical Methods in Computer ScienceWe propose a simple imperative programming language, ERC, that features arbitrary real numbers as primitive data type, exactly. Equipped with a denotational semantics, ERC provides a formal programming language-theoretic foundation to the algorithmic ...
Sewon Park +9 more
doaj +1 more source
On Linear Information Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Scott's information systems provide a categorically equivalent, intensional description of Scott domains and continuous functions. Following a well established pattern in denotational semantics, we define a linear version of information systems ...
A. Bucciarelli +3 more
doaj +1 more source
Typing weak MSOL properties [PDF]
Logical Methods in Computer Science, 2017 We consider lambda-Y-calculus as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be seen as the tree of calls to built-in operations.
Sylvain Salvati, Igor Walukiewicz
doaj +1 more source
, 2010 The goal of this lecture is to show how modern theorem provers---in this case, the Coq proof assistant---can be used to mechanize the specification of programming languages and their semantics, and to reason over individual programs and over generic ...
Leroy, Xavier
core +4 more sources
The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types [PDF]
Logical Methods in Computer Science, 2017 We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs.
Ranald Clouston +3 more
doaj +1 more source
Denotational Semantics and Refinement [PDF]
Electronic Workshops in Computing, 1997 Denotational descriptions are frequently presented in terms of a sequence of descriptions of programming languages of increasing complexity. We discuss a formal approach to the study of such description sequences in terms of a refinement relation, showing how the informal use made of this approach in tutorial introductions to denotational semantics may
Steve Riddle, Peter J. L. Wallis
openaire +2 more sources
Theoretical Computer Science, 1984 AbstractIn this paper we propose a new denotational semantics for CSP. The domains used in the semantics are very simple, compared to those used in other approaches to the semantics of CSP. Moreover, our denotations are more abstract than those of the other approaches.
openaire +2 more sources
Denotational semantics for occam [PDF]
, 1985 A denotational semantics is given for a large subset of occam, a programming language for concurrent systems. The semantic domain used is a "failure-sets" model modified to allow machine states to be properly dealt with. The applications of the semantics are discussed briefly, and we see how the natural congruence induced by the semantics allows us to ...
openaire +3 more sources
Substructural Observed Communication Semantics [PDF]
EPTCS 322, 2020, pp. 69-87, 2020 Session-types specify communication protocols for communicating processes, and session-typed languages are often specified using substructural operational semantics given by multiset rewriting systems. We give an observed communication semantics for a session-typed language with recursion, where a process's observation is given by its external ...
arxiv +1 more source
Modularity in Denotational Semantics
Electronic Notes in Theoretical Computer Science, 1997 AbstractWe consider a modular approach to denotational semantics. We reformulate and extend the idea of monads as notions of computation to algebraic structure together with a construction of an extended semantic category. We show that upon making that reformulation, one can obtain some account of modularity, in particular accounting for the ...
openaire +2 more sources