Sciweavers

200 search results - page 25 / 40
» The Intensional Lambda Calculus
Sort
View
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 9 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
ENTCS
2007
100views more  ENTCS 2007»
13 years 9 months ago
Extensionality of Spatial Observations in Distributed Systems
We discuss the tensions between intensionality and extensionality of spatial observations in distributed systems, showing that there are natural models where extensional observati...
Luís Caires, Hugo Torres Vieira
ICFP
2004
ACM
14 years 9 months ago
Translating dependency into parametricity
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
Stephen Tse, Steve Zdancewic
APAL
2010
129views more  APAL 2010»
13 years 10 months ago
Kripke models for classical logic
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
Danko Ilik, Gyesik Lee, Hugo Herbelin
ACL
2001
13 years 11 months ago
An Algebra for Semantic Construction in Constraint-based Grammars
We develop a framework for formalizing semantic construction within grammars expressed in typed feature structure logics, including HPSG. The approach provides an alternative to t...
Ann A. Copestake, Alex Lascarides, Dan Flickinger