Results 11 to 20 of about 228,658 (258)
Trace types and denotational semantics for sound programmable inference in probabilistic languages [PDF]
Proc. ACM Program. Lang., 2019 Modern probabilistic programming languages aim to formalize and automate key aspects of probabilistic modeling and inference. Many languages provide constructs for programmable inference that enable developers to improve inference speed and accuracy by ...
Alexander K. Lew +4 more
openalex +2 more sources
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 +2 more sources
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 +4 more sources
A denotational semantics for Timed Linda [PDF]
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, 2001 In [5] we introduced a Timed Linda language (T-Linda) whic hwas obtained by a natural timed interpretation of the usual constructs of the Linda model and by including a simple primitive for specifying time-outs. Here we define a denotational model for T-Linda which is based on timed reactive sequences.
Frank S. de Boer +2 more
openalex +7 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.
Olivier Danvy
openalex +3 more sources
On infinite computations in denotational semantics
Theoretical Computer Science, 1984 AbstractFinite and, especially, infinite computations in languages with iteration or recursion are studied in the framework of denotational semantics, and a theorem is proved which relates their syntactic and semantic characterizations. A general proof method is presented to establish this type of relations, and it is shown how—in an induction on the ...
J. W. de Bakker +2 more
openalex +3 more sources
A denotational semantics for Prolog [PDF]
ACM Transactions on Programming Languages and Systems, 1989 A denotational semantics is presented for the language Pro.og. Metapredicates are not considered. Conventional control sequencing is assumed for Prolog's execution. The semantics is nonstandard, and goal continuations are used to explicate the sequencing.
Tim Nicholson, Norman Foo
openalex +3 more sources
Denotational Semantics of Hybrid Automata [PDF]
The Journal of Logic and Algebraic Programming, 2006 AbstractWe introduce a denotational semantics for non-linear hybrid automata and relate it to the operational semantics given in terms of hybrid trajectories. The semantics is defined as least fixpoint of an operator on the continuous domain of functions of time that take values in the lattice of compact subsets of n-dimensional Euclidean space.
Abbas Edalat, Dirk Pattinson
openalex +5 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