Sciweavers

680 search results - page 88 / 136
» Types for the Ambient Calculus
Sort
View
LICS
2000
IEEE
14 years 1 months ago
Game Semantics and Subtyping
While Game Semantics has been remarkably successful at g, often in a fully abstract manner, a wide range of features of programming languages, there has to date been no attempt at...
Juliusz Chroboczek
FSTTCS
1999
Springer
14 years 1 months ago
Explicit Substitutions and Programming Languages
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
Jean-Jacques Lévy, Luc Maranget
APAL
2008
112views more  APAL 2008»
13 years 9 months ago
A domain model characterising strong normalisation
Building on previous work by Coquand and Spiwack [8] we construct a strict domaintheoretic model for the untyped -calculus with pattern matching and term rewriting which has the p...
Ulrich Berger
JLP
2002
90views more  JLP 2002»
13 years 8 months ago
Combining programs and state machines
State machines consume and process actions complementary to programs issuing actions. State machines maintain a state and reply with a boolean response to each action in their int...
Jan A. Bergstra, Alban Ponse
ICFP
1997
ACM
14 years 1 months ago
Foundations for the Implementation of Higher-Order Subtyping
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
Karl Crary