Sciweavers

424 search results - page 64 / 85
» A Lambda Calculus with Forms
Sort
View
CMSB
2011
Springer
12 years 8 months ago
Reversible structures
Reversible structures are computational units that may progress forward and backward. We study weak coherent structures that are primarily inspired by dna circuits and may be comp...
Luca Cardelli, Cosimo Laneve
LISP
2007
74views more  LISP 2007»
13 years 8 months ago
Improving the lazy Krivine machine
Krivine presents the K machine, which produces weak head normal form results. Sestoft introduces several call-by-need variants of the K machine that implement result sharing via pu...
Daniel P. Friedman, Abdulaziz Ghuloum, Jeremy G. S...
CADE
1998
Springer
14 years 1 months ago
System Description: leanK 2.0
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
Bernhard Beckert, Rajeev Goré
JFP
2008
72views more  JFP 2008»
13 years 8 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
JLP
2011
155views more  JLP 2011»
13 years 3 months ago
QoS negotiation in service composition
Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services. Quality of Servic...
Maria Grazia Buscemi, Ugo Montanari