Results 21 to 30 of about 230,502 (255)
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 +8 more sources
Denotational semantics for occam [PDF]
Seminar on Concurrency, 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 ...
A. W. Roscoe
openaire +4 more sources
A Denotational Semantics for Handel-C
Formal Aspects of Computing, 2007 AbstractWe present a denotational semantics for a fully functional subset of the Handel-C hardware compilation language (Celoxica Ltd., Handel-C Language Reference Manual, v3.0, 2002,http://www.celoxica.com), based on the concept of typed assertion traces.
A. Butterfield
openaire +2 more sources
Semantics and Algebraic Specification, 2008 We derive two big-step abstract machines, a natural semantics, and the valuation function of a denotational semantics based on the small-step abstract machine for Core Scheme presented by Clinger at PLDI'98.
O. Danvy
semanticscholar +3 more sources
Disentangling Denotational Semantics Definitions [PDF]
, 2008 JUCS - Journal of Universal Computer Science Volume Nr.
Tirelo,Fabio +2 more
openaire +4 more sources
Modular Denotational Semantics for Effects with Guarded Interaction Trees [PDF]
Proc. ACM Program. Lang., 2023 We present guarded interaction trees — a structure and a fully formalized framework for representing higher-order computations with higher-order effects in Coq, inspired by domain theory and the recently proposed interaction trees.
D. Frumin, Amin Timany, L. Birkedal
semanticscholar +1 more source
Denotational semantics of general store and polymorphism [PDF]
arXiv.org, 2022 We contribute the first denotational semantics of polymorphic dependent type theory extended by an equational theory for general (higher-order) reference types and recursive types, based on a combination of guarded recursion and impredicative ...
Jonathan Sterling +2 more
semanticscholar +1 more source
Smart Choices and the Selection Monad [PDF]
Logical Methods in Computer Science, 2023 Describing systems in terms of choices and their resulting costs and rewards offers the promise of freeing algorithm designers and programmers from specifying how those choices should be made; in implementations, the choices can be realized by ...
Martin Abadi, Gordon Plotkin
doaj +1 more source
Null values in data base management a denotational semantics approach [PDF]
ACM SIGMOD Conference, 1979 Y. Vassiliou
semanticscholar +2 more sources
A straightforward denotational semantics for non-determinate data flow programs [PDF]
ACM-SIGACT Symposium on Principles of Programming Languages, 1978 Paul R. Kosinki
semanticscholar +2 more sources