47 citations · 88 across the 7 of their papers we have counts for
Showing 2010 · cs.LOShow all
3 papers · 2 filters
cs.LO2010★ 4 cited
On the meaning of logical completeness
Michele Basaldella, Kazushige Terui
Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. O…
cs.LO2010★ 7 cited
Semantics of Typed Lambda-Calculus with Constructors
Barbara Petit
We present a Curry-style second-order type system with union and intersection types for the lambda-calculus with constructors of Arbiser, Miquel and Rios, an extension of lambda-ca…
cs.LO2010★ 13 cited
Church => Scott = Ptime: an application of resource sensitive realizability
Aloïs Brunel, Kazushige Terui
We introduce a variant of linear logic with second order quantifiers and type fixpoints, both restricted to purely linear formulas. The Church encodings of binary words are typed b…