Results 31 to 40 of about 11,768 (185)
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
The Sigma-Semantics: A Comprehensive Semantics for Functional Programs [PDF]
, 1996 A comprehensive semantics for functional programs is presented, which generalizes the well-known call-by-value and call-by-name semantics. By permitting a separate choice between call-by value and call-by-name for every argument position of every ...
Chitil, Olaf
core +4 more sources
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
, 2011 Process Algebras are mathematically rigorous languages with well defined semantics that permit describing and verifying properties of concurrent communicating systems.
De Nicola, Rocco
core +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
Linear Haskell: practical linearity in a higher-order polymorphic language [PDF]
, 2017 Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear type system designed with two crucial properties in mind: backwards ...
Bernardy, Jean-Philippe +4 more
core +3 more sources
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