Sciweavers

314 search results - page 50 / 63
» Compactness Properties for Stable Semantics of Logic Program...
Sort
View
ICFP
2003
ACM
15 years 9 months ago
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 data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
POPL
2005
ACM
15 years 9 months ago
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
John Field, Carlos A. Varela
LOGCOM
2010
158views more  LOGCOM 2010»
14 years 7 months ago
Applying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
Giulio Manzonetto, Antonino Salibra
LICS
2002
IEEE
15 years 2 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
CIE
2010
Springer
15 years 2 months ago
Focusing in Asynchronous Games
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
Samuel Mimram