Sciweavers

239 search results - page 24 / 48
» The Safe Lambda Calculus
Sort
View
ACL
2006
15 years 1 months ago
Translating HPSG-Style Outputs of a Robust Parser into Typed Dynamic Logic
The present paper proposes a method by which to translate outputs of a robust HPSG parser into semantic representations of Typed Dynamic Logic (TDL), a dynamic plural semantics de...
Manabu Sato, Daisuke Bekki, Yusuke Miyao, Jun-ichi...
ENTCS
2006
89views more  ENTCS 2006»
14 years 11 months ago
A Type-theoretic Reconstruction of the Visitor Pattern
In object-oriented languages, the Visitor pattern can be used to traverse tree-like data structures: a visitor object contains some operations, and the data structure objects allo...
Peter Buchlovsky, Hayo Thielecke
CORR
2004
Springer
123views Education» more  CORR 2004»
14 years 11 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
CSL
2000
Springer
15 years 4 months ago
Disjunctive Tautologies as Synchronisation Schemes
In the ambient logic of classical second order propositional calculus, we solve the specification problem for a family of excluded middle like tautologies. These are shown to be r...
Vincent Danos, Jean-Louis Krivine
LICS
2008
IEEE
15 years 6 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...