Results 1 to 10 of about 432,853 (282)
Full abstraction for fair testing in CCS (expanded version) [PDF]
Logical Methods in Computer Science, 2014 In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent form of presheaf semantics and as a concurrent form of game semantics.
Tom Hirschowitz
doaj +7 more sources
Full abstraction for PCF [PDF]
Information and Computation, 2016 50 ...
Abramsky, S, Jagadeesan, R, Malacaria, P
core +6 more sources
Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion [PDF]
Logical Methods in Computer Science, 2012 We study the semantics of a resource-sensitive extension of the lambda calculus in a canonical reflexive object of a category of sets and relations, a relational version of Scott's original model of the pure lambda calculus.
Thomas Ehrhard +3 more
doaj +4 more sources
Modular, Fully-abstract Compilation by Approximate Back-translation [PDF]
Logical Methods in Computer Science, 2017 A compiler is fully-abstract if the compilation from source language programs to target language programs reflects and preserves behavioural equivalence.
Dominique Devriese +3 more
doaj +3 more sources
Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators [PDF]
Logical Methods in Computer Science, 2009 The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation.
Damiano Mazza
doaj +3 more sources
Full Abstraction for Probabilistic PCF [PDF]
Journal of the ACM, 2018 We present a probabilistic version of PCF, a well-known simply typed universal functional language. The type hierarchy is based on a single ground type of natural numbers. Even if the language is globally call-by-name, we allow a call-by-value evaluation for ground-type arguments to provide the language with a suitable algorithmic expressiveness.
Thomas Ehrhard, Christine Tasson
exaly +4 more sources
Probabilistic call by push value [PDF]
Logical Methods in Computer Science, 2019 We introduce a probabilistic extension of Levy's Call-By-Push-Value. This extension consists simply in adding a " flipping coin " boolean closed atomic expression. This language can be understood as a major generalization of Scott's PCF encompassing both
Thomas Ehrhard, Christine Tasson
doaj +3 more sources
Full Abstraction and the Context Lemma [PDF]
SIAM Journal on Computing, 1996 This paper is on formalization of programming languages and is based on the \(\lambda\)-calculus apparatus. The language PCF was being considered, Scott's simply typed \(\lambda\)-calculus for recursive functions on the integers. The contribution of this paper is a simple restriction on the format of rewrite rules which is sufficient to guarantee ...
Jim, Trevor, Meyer, Albert R.
exaly +2 more sources
Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency [PDF]
Logical Methods in Computer Science, 2014 We define a pi-calculus variant with a costed semantics where channels are treated as resources that must explicitly be allocated before they are used and can be deallocated when no longer required.
Adrian Francalanza +2 more
doaj +5 more sources
Using higher-order contracts to model session types [PDF]
Logical Methods in Computer Science, 2016 Session types are used to describe and structure interactions between independent processes in distributed systems. Higher-order types are needed in order to properly structure delegation of responsibility between processes.
Giovanni Bernardi, Matthew Hennessy
doaj +3 more sources