Results 41 to 50 of about 2,907 (227)
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
QWIRE Practice: Formal Verification of Quantum Circuits in Coq [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties of those circuits using Coq's theorem proving features. The
Robert Rand +2 more
doaj +1 more source
On the Interpretation of Denotational Semantics
PhilosophiesThe denotational approach to the semantics of programming languages views program meanings as elements of domains, abstract partially ordered structures that form the basis of a mathematical theory of computation.
Felice Cardone
doaj +1 more source
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
Abstract and Applied Analysis, 2013 In 1994, Matthews introduced the notion of partial metric space with the aim of providing a quantitative mathematical model suitable for program verification.
N. Shahzad, O. Valero
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
IMP with exceptions over decorated logic [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with “decorations”that describe what computational (side) effect evaluation of a term may involve.
Burak Ekici
doaj +1 more source
A trajectory-based strict semantics for program slicing
, 2010 We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Weiser (which only considered terminating ones) and, as such, is an accurate ...
Kiss, A +26 more
core +1 more source
Denotational Semantics of the Simplified Lambda-Mu Calculus and a New Deduction System of Classical Type Theory [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Classical (or Boolean) type theory is the type theory that allows the type inference (σ \to \bot) \to \bot => σ (the type counterpart of double-negation elimination), where σ is any type and \bot is absurdity type.
Ken Akiba
doaj +1 more source
The Denotational Semantics of SSA
CoRR95 pages, 38 figures, mechanization available at https://github.com/imbrem/debruijn-ssa/tree/toplas ...
Jad Elkhaleq Ghalayini +1 more
openaire +2 more sources