Search Results

M. H. Newman's Typability Algorithm for Lambda-calculus

Author: Hindley, J. Roger

Source: Journal of Logic and Computation, Volume 18, Number 2, 16 April 2008 , pp. 229-238(10)

Publisher: Oxford University Press

Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters

Author: Minari, Pierluigi

Source: Archive for Mathematical Logic, Volume 46, Numbers 5-6, July 2007 , pp. 385-424(40)

Publisher: Springer

Full Text

Author: Awodey, Steve

Source: Category Theory, May 2006 , pp. i-256(257)

Publisher: Oxford Scholarship Online Monographs

Call-by-push-value: Decomposing call-by-value and call-by-name

Author: Levy, Paul

Source: LISP and Symbolic Computation, Volume 19, Number 4, December 2006 , pp. 377-414(38)

Publisher: Springer

A Variadic Extension of Curry's Fixed-Point Combinator

Author: Goldberg, Mayer

Source: LISP and Symbolic Computation, Volume 18, Numbers 3-4, December 2005 , pp. 371-388(18)

Publisher: Springer

Probabilistic -calculus and Quantitative Program Analysis

Authors: Di Pierro, Alessandra; Hankin, Chris; Wiklicky, Herbert

Source: Journal of Logic and Computation, Volume 15, Number 2, April 2005 , pp. 159-179(21)

Publisher: Oxford University Press

Director Strings Revisited: A Generic Approach to the Efficient Representation of Free Variables in Higher-order Rewriting

Author: Sinot, François-Règis

Source: Journal of Logic and Computation, Volume 15, Number 2, April 2005 , pp. 201-218(18)

Publisher: Oxford University Press

Interaction Net Implementation of Additive and Multiplicative Structures

Author: Mackie, Ian

Source: Journal of Logic and Computation, Volume 15, Number 2, April 2005 , pp. 219-237(19)

Publisher: Oxford University Press

Forthcoming Papers

Source: Journal of Logic and Computation, Volume 15, Number 2, April 2005 , pp. 239-240(2)

Publisher: Oxford University Press

On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms

Authors: Philippe Groote; Sylvain Pogodalla

Source: Journal of Logic, Language and Information, Volume 13, Number 4, March 2004 , pp. 421-438(18)

Publisher: Springer

An Essay in -Calculus

Author: Pasquali C.

Source: Metroeconomica, Volume 55, Numbers 2-3, May 2004 , pp. 265-289(25)

Publisher: Blackwell Publishing

Computational Semantics in Discourse: Underspecification, Resolution, and Inference

Author: Bos J.

Source: Journal of Logic, Language and Information, Volume 13, Number 2, 2004 , pp. 139-157(19)

Publisher: Springer

Semantics for Dual and Symmetric Combinatory Calculi

Author: Bimbó K.

Source: Journal of Philosophical Logic, Volume 33, Number 2, April 2004 , pp. 125-153(29)

Publisher: Springer

Termination, deadlock and divergence in the -calculus with multiplicities

Authors: Boudol G.; Laneve C.

Source: Electronic Notes in Theoretical Computer Science, Volume 1, Number 1, January 2004 , pp. 1-14(14)

Publisher: Elsevier

On a Modal -Calculus for S4

Authors: Pfenning F.; Wong H.C.

Source: Electronic Notes in Theoretical Computer Science, Volume 1, Number 1, January 2004 , pp. 1-20(20)

Publisher: Elsevier

_S - An implicitly parallel -calculus with recursive bindings, synchronization and side effects

Authors: Arvind; Maessen J.-W.; Nikhil R.S.; Stoy J.E.

Source: Electronic Notes in Theoretical Computer Science, Volume 16, Number 3, January 2004 , pp. 1-26(26)

Publisher: Elsevier

A Core Calculus of Classes and Objects

Authors: Bono V.; Patel A.; Shmatikov V.; Mitchell J.

Source: Electronic Notes in Theoretical Computer Science, Volume 20, Number 1, January 2004 , pp. 1-22(22)

Publisher: Elsevier

Direct Models for the Computational Lambda-calculus

Author: Fuhrmann C.

Source: Electronic Notes in Theoretical Computer Science, Volume 20, Number 1, January 2004 , pp. 1-48(48)

Publisher: Elsevier

Relating Natural Deduction and Sequent Calculus for Intuitionistic Non-Commutative Linear Logic

Authors: Polakow J.; Pfenning F.

Source: Electronic Notes in Theoretical Computer Science, Volume 20, Number 1, January 2004 , pp. 1-18(18)

Publisher: Elsevier

From Bohm's Theorem to Observational Equivalences - An Informal Account

Authors: Dezani-Ciancaglini M.; Giovannetti E.

Source: Electronic Notes in Theoretical Computer Science, Volume 50, Number 2, January 2004 , pp. 1-34(34)

Publisher: Elsevier