A new approach to abstract syntax with variable binding
The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and
Mostowski in the 1930s, supports notions of 'name-abstraction'and 'fresh name'that provide …
Mostowski in the 1930s, supports notions of 'name-abstraction'and 'fresh name'that provide …
A new approach to abstract syntax involving binders
The Fraenkel-Mostowski permutation model of set theory with atoms (FM-sets) can serve as
the semantic basis of meta-logics for specifying and reasoning about formal systems …
the semantic basis of meta-logics for specifying and reasoning about formal systems …
A fully abstract game semantics for general references
S Abramsky, K Honda… - … . Thirteenth Annual IEEE …, 1998 - ieeexplore.ieee.org
A games model of a programming language with higher-order store in the style of ML-
references is introduced. The category used for the model is obtained by relaxing certain …
references is introduced. The category used for the model is obtained by relaxing certain …
[图书][B] Call-by-push-value: A Functional/imperative Synthesis
PB Levy - 2012 - books.google.com
Call-by-push-value is a programming language paradigm that, surprisingly, breaks down the
call-by-value and call-by-name paradigms into simple primitives. This monograph, written for …
call-by-value and call-by-name paradigms into simple primitives. This monograph, written for …
Semantical analysis of higher-order abstract syntax
M Hofmann - Proceedings. 14th Symposium on Logic in …, 1999 - ieeexplore.ieee.org
Semantical analysis of higher-order abstract syntax Page 1 Semantical analysis of higher-order
abstract syntax Martin Hofmann * Synopsis: A functor category semantics for higher-order abstract …
abstract syntax Martin Hofmann * Synopsis: A functor category semantics for higher-order abstract …
FreshML: Programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating
syntactical data involving statically scoped binding operations. User-declared FreshML …
syntactical data involving statically scoped binding operations. User-declared FreshML …
Operationally-based theories of program equivalence
AM Pitts - Semantics and Logics of Computation, 1997 - books.google.com
This article describes some mathematical methods for verifying properties of programs in
higher-order, functional languages. We focus on methods for reasoning about equivalence …
higher-order, functional languages. We focus on methods for reasoning about equivalence …
Linearity, Sharing and State: A Fully Abstract Game Semantics for Idealized Algol with Active Expressions
S Abramsky, G McCusker - Algol-like languages, 1997 - Springer
6 IA-{new} 7 Modelling new 8 Computational Adequacy 9 Full Abstraction 10 The
Extensional Model 11 Related Work 12 Further Directions References The manipulation of …
Extensional Model 11 Related Work 12 Further Directions References The manipulation of …
Semantics of name and value passing
M Firore, D Turi - … 16th Annual IEEE Symposium on Logic in …, 2001 - ieeexplore.ieee.org
Provides a semantic framework for (first-order) message-passing process calculi by
combining categorical theories of abstract syntax with binding and operational semantics. In …
combining categorical theories of abstract syntax with binding and operational semantics. In …
Modal logics are coalgebraic
Applications of modal logics are abundant in computer science, and a large number of
structurally different modal logics have been successfully employed in a diverse spectrum of …
structurally different modal logics have been successfully employed in a diverse spectrum of …