Results 31 to 40 of about 228,658 (258)
Denotational semantics for guarded dependent type theory [PDF]
Mathematical Structures in Computer Science, 2018 We present a new model of guarded dependent type theory (GDTT), a type theory with guarded recursion and multiple clocks in which one can program with and reason about coinductive types. Productivity of recursively defined coinductive programs and proofs
A. Bizjak, R. E. Møgelberg
semanticscholar +1 more source
Disentangling Denotational Semantics Definitions [PDF]
, 2008 JUCS - Journal of Universal Computer Science Volume Nr.
Fábio Tirelo +2 more
openalex +4 more sources
Exercises in denotational semantics [PDF]
, 1976 Krzysztof R. Apt, J. W. de Bakker
openalex +3 more sources
Denotational semantics of recursive types in synthetic guarded domain theory [PDF]
Logic in Computer Science, 2016 Guarded recursion is a form of recursion where recursive calls are guarded by delay modalities. Previous work has shown how guarded recursion is useful for reasoning operationally about programming languages with advanced features including general ...
Rasmus E. Møgelberg, M. Paviotti
semanticscholar +1 more source
Decorated proofs for computational effects: States [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The syntax of an imperative language does not mention explicitly the state, while its denotational semantics has to mention it. In this paper we show that the equational proofs about an imperative language may hide the state, in the same way as the ...
Jean-Guillaume Dumas +3 more
doaj +1 more source
Ticking clocks as dependent right adjoints: Denotational semantics for clocked type theory [PDF]
Logical Methods in Computer Science, 2020 Clocked Type Theory (CloTT) is a type theory for guarded recursion useful for programming with coinductive types, allowing productivity to be encoded in types, and for reasoning about advanced programming language features using an abstract form of step ...
Bassel Mannaa +2 more
doaj +1 more source
Electronic Proceedings in Theoretical Computer Science, 2013 We introduce a functional calculus with simple syntax and operational semantics in which the calculi introduced so far in the Curry-Howard correspondence for Classical Logic can be faithfully encoded.
Alberto Carraro +2 more
doaj +1 more source
A denotational semantics for Handel-C
Formal Aspects of Computing, 2011 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
semanticscholar +2 more sources
Action semantics in retrospect [PDF]
, 2009 This paper is a themed account of the action semantics project, which Peter Mosses has led since the 1980s. It explains his motivations for developing action semantics, the inspirations behind its design, and the foundations of action semantics based on ...
D.A. Watt +13 more
core +1 more source
A Denotational Semantics for Circus
Electronic Notes in Theoretical Computer Science, 2007 AbstractCircus specifications define both data and behavioural aspects of systems using a combination of Z and CSP. Previously, a denotational semantics has been given to Circus; however, as a shallow embedding of Circus in Z, it was not possible to use it to prove properties like the refinement laws that justify the distinguishing development ...
Ana Cavalcanti +2 more
openaire +2 more sources