bibliographer - lambda-calculus

Quantitative Types for the Functional Machine Calculus Willem Heijltjes Fri 31 October 2025
A Definitional Approach to Primitivexs Recursion over Higher Order Abstract Syntax S. J. Ambler R. L. Crole Alberto Momigliano Sun 14 February 2021
Stable Relations and Abstract Interpretation of Higher-Order Programs Benoît Montagu Thomas Jensen Tue 04 August 2020
Programming language foundations in Agda Wen Kokke Jeremy G. Siek Philip Wadler Tue 09 June 2020
The Geometry of Linear Higher-order Recursion Ugo Dal Lago Thu 02 May 2019
Lambda-calculus and formal language theory Sylvain Salvati Mon 05 November 2018
Probabilistic lambda-theories Thomas Leventis Mon 02 April 2018
Intersection Type Calculi of Bounded Dimension Andrej Dudenhefner Jakob Rehof Tue 05 December 2017
A logical approach to grammar description Lionel Clément Jérôme Kirman Sylvain Salvati Thu 24 March 2016
Exponentials with Infinite Multiplicities Alberto Carraro Thomas Ehrhard Antonino Salibra Thu 10 September 2015
Types in lambda calculi and programming languages Henk Barendregt Kees Hemerik Wed 10 July 2013
The Calculi of Lambda-Conversion Alonzo Church Tue 09 July 2013
A unified approach to fully lazy sharing Thibaut Balabonski Wed 03 July 2013
Lambda Calculus and Types Andrew D. Ker Mon 24 June 2013
The Scott model of linear logic is the extensional collapse of its relational model Thomas Ehrhard Mon 24 June 2013
Definitional interpreters for higher-order programming languages John C. Reynolds Tue 18 June 2013
Semantique de Jeux et Decidabilite dans PCF Pierre Clairambault Wed 05 June 2013
Lambda lifting: Transforming programs to recursive equations Thomas Johnsson Thu 02 May 2013
New Developments in Environment Machines Maribel Fernandez Nikolaos Siafakas Mon 29 April 2013
TIM: A simple, lazy abstract machine to execute supercombinators John Fairbairn Stuart Wray Mon 29 April 2013
Deriving a lazy abstract machine Peter Sestoft Mon 29 April 2013
Comparing Boehm-Like Trees Jeroen Ketema Tue 16 April 2013
Improving the lazy Krivine machine Daniel P. Friedman Abdulaziz Ghuloum Jeremy G. Siek Onnie Lynn Winebarger Tue 16 April 2013
Loader and Urzyczyn Are Logically Related Sylvain Salvati Giulio Manzonetto Mai Gehrke Henk Barendregt Wed 27 March 2013
Control operators, the SECD-machine, and the lambda-calculus Matthias Felleisen Daniel P. Friedman Mon 11 March 2013
A syntactic correspondence between context-sensitive calculi and abstract machines Magorzata Biernacka Olivier Danvy Mon 11 March 2013
A formulae-as-type notion of control Timothy G. Griffin Mon 11 March 2013
The mechanical evaluation of expressions Peter Landin Fri 01 March 2013
Notes on Simply Typed Lambda Calculus Ralph Loader Tue 26 February 2013
Logical Relations Andrzej Murawski Tue 26 February 2013
Proof of normalisation using domain theory Thierry Coquand Arnaud Spivak Mon 25 February 2013
A unification algorithm for typed ^I-calculus G.P. Huet Tue 19 February 2013
Unification of Simply Typed Lambda-Terms as Logic Programming Dale Miller Tue 19 February 2013
Unary PCF is decidable Ralph Loader Tue 19 February 2013
Decidability of fourth-order matching Vincent Padovani Tue 19 February 2013
Dependency Tree Automata Colin Stirling Tue 19 February 2013
Decidability of all minimal models Vincent Padovani Tue 19 February 2013
Higher-order rewrite systems and their confluence Richard Mayr Tobias Nipkow Mon 18 February 2013
Building-in Equational Theories Gordon Plotkin Mon 18 February 2013
Higher-Order Unification and Matching Gilles Dowek Mon 18 February 2013
Prelogical Relations Furio Honsell Donald Sannella Mon 18 February 2013
The inhabitation problem for intersection types M W Bunder Mon 18 February 2013
Finitary PCF is not decidable Ralph Loader Mon 18 February 2013
Reasoning about sequential functions via logical relations Kurt Sieber Mon 18 February 2013
Lambda-Definability in the Full Type Hierarchy Gordon Plotkin Sun 17 February 2013
Lambda-definability and Logical Relations Gordon Plotkin Sun 17 February 2013
Inhabitation in typed lambda-calculi (a syntactic approach) Pawel Urzyczyn Sat 16 February 2013
On Statman's Finite Completeness Theorem Richard Statman Gilles Dowek Fri 15 February 2013
Completeness, Invariance and łambda-Definability R. Statman Fri 15 February 2013
Completeness in the Theory of Types Leon Henkin Thu 14 February 2013
Call-by-Name, Call-by-Value and the lambda-Calculus Gordon Plotkin Wed 30 January 2013
On Continuous Normalization Klaus Aehlig Felix Joachimski Mon 28 January 2013
Environmental bisimulations for higher-order languages Davide Sangiorgi Naoki Kobayashi Eijiro Sumii Mon 28 January 2013
The safe lambda calculus William Blum C.-H. Luke Ong Fri 14 December 2012
Theorems for free Philip Wadler Fri 14 December 2012
Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence Val Tannen Jean H. Gallier Fri 26 October 2012
Strong normalizability for the combined system of the typed lmbda calculus and an arbitrary convergent term rewrite system M. Okada Fri 26 October 2012
The simply typed rewriting calculus Horatiu Cirstea Claude Kirchner Thu 11 October 2012
A simple machine [based on the SK-combinator reduction mechanism] A. Dickinson M.T. Pope Fri 28 September 2012
łambdamu-Calculus: An algorithmic interpretation of classical natural deduction Michel Parigot Sat 07 July 2012
Towards nominal computation Mikolaj Bojanczyk Laurent Braud Bartek Klin Slawomir Lasota Tue 12 June 2012
Computability and łambda-Definability Alan M. Turing Mon 11 June 2012
The categorical abstract machine G. Cousineau P.-L. Curien M. Mauny Thu 26 April 2012
Fully abstract models of typed lambda-calculi Robin Milner Thu 12 April 2012
LCF considered as a programming language Gordon Plotkin Tue 06 March 2012
On the correctness of the Krivine machine Mitchell Wand Tue 06 March 2012
A call-by-name lambda-calculus machine Jean-Louis Krivine Tue 06 March 2012
Krivine Machines and Higher-Order Schemes S. Salvati I. Walukiewicz Tue 06 March 2012

Library Size: 13G (68 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]