Results 31 to 40 of about 11,766 (228)
Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism [PDF]
Logical Methods in Computer Science, 2021 We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which compute them.
James Laird
doaj +1 more source
Electronic Proceedings in Theoretical Computer Science, 2014 A denotational semantics of quantum Turing machines having a quantum control is defined in the dagger compact closed category of finite dimensional Hilbert spaces.
Miklós Bartha
doaj +1 more source
Programming Denotational Semantics II [PDF]
The Computer Journal, 1985 The Denotational Semantics of a small programming language is coded into Algol-68 to give an interpreter. The Semantics incorporates many of the notions of Standard Semantics including declarations, declaration continuations, final answers and stores or memory which are used to define block structuring, output and parameterless procedures. This extends
openaire +2 more sources
Semantics of a Typed Algebraic Lambda-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space.
Benoît Valiron
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
Reversible Barbed Congruence on Configuration Structures [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 A standard contextual equivalence for process algebras is strong barbed congruence. Configuration structures are a denotational semantics for processes in which one can define equivalences that are more discriminating, i.e.
Clément Aubert, Ioana Cristescu
doaj +1 more source
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
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
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