Results 31 to 40 of about 85,558 (251)
A Simple Semantics and Static Analysis for Stack Inspection [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 The Java virtual machine and the .NET common language runtime feature an access control mechanism specified operationally in terms of run-time stack inspection. We give a denotational semantics in "eager" form, and show that it is equivalent to the "lazy"
Anindya Banerjee, David A. Naumann
doaj +1 more source
Semantic Domains and Denotational Semantics
DAIMI Report Series, 1989 <p>Denotational Semantics is a framework for the formal description of programming language semantics. The main idea of Denotational Semantics is that each phrase of the described language is given a <em>denotation</em>: a mathematical object that represents the contribution of the phrase to the meaning of any program in which it ...
Gunter, Carl A +2 more
openaire +5 more sources
Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice [PDF]
, 2001 This paper provides a case-study in the field of metric semantics for probabilistic programming. Both an operational and a denotational semantics are presented for an abstract process language L_pr, which features action refinement and probabilistic ...
Bakker, J.W. de +2 more
core +4 more sources
Modeling Simply-Typed Lambda Calculi in the Category of Finite Vector Spaces [PDF]
Scientific Annals of Computer Science, 2014 In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite models, one ...
B. Valiron, S. Zdancewic
doaj +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
A denotational semantics for equilibrium logic [PDF]
Theory and Practice of Logic Programming, 2015 AbstractIn this paper we provide an alternative semantics for Equilibrium Logic and its monotonic basis, the logic of Here-and-There (also known as Gödel'sG3logic) that relies on the idea ofdenotationof a formula, that is, a function that collects the set of models of that formula.
Pedro Cabalar +4 more
openaire +3 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
An Effect System for Algebraic Effects and Handlers [PDF]
Logical Methods in Computer Science, 2014 We present an effect system for core Eff, a simplified variant of Eff, which is an ML-style programming language with first-class algebraic effects and handlers. We define an expressive effect system and prove safety of operational semantics with respect
Andrej Bauer, Matija Pretnar
doaj +1 more source
On phase semantics and denotational semantics: the exponentials
Annals of Pure and Applied Logic, 2001 AbstractWe extend to the exponential connectives of linear logic the study initiated in Bucciarelli and Ehrhard (Ann. Pure. Appl. Logic 102 (3) (2000) 247). We define an indexed version of propositional linear logic and provide a sequent calculus for this system.
Ehrhard, Thomas, Bucciarelli, Antonio
openaire +4 more sources
Denotational semantics for timed testing [PDF]
, 1997 In this paper we present a denotational semantics for a timed process algebra, which is fully abstract with respect to the must testing semantics previously developed [Lla96,LdFN96]. The domain of semantic processes is made up of consistent sets of barbs, which generalize the notion of acceptance sets, in such a way that the actions that are offered ...
Llana Díaz, Luis Fernando +1 more
openaire +3 more sources