Search results for "Call-by-name"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
15	Rémi Douence, Pascal Fradet	A Systematic Study of Functional Language Implementations.	ACM Trans. Program. Lang. Syst.	1998	DBLP DOI BibTeX RDF	compilers, program transformation, functional programming, combinators, abstract machines
15	Torben Æ. Mogensen	Types for 0, 1 or Many Uses.	Implementation of Functional Languages	1997	DBLP DOI BibTeX RDF
15	Sheng Liang, Paul Hudak, Mark P. Jones	Monad Transformers and Modular Interpreters.	POPL	1995	DBLP DOI BibTeX RDF
15	Anindya Banerjee 0001, David A. Schmidt	A Categorical Interpretation of Landin's Correspondence Principle.	MFPS	1993	DBLP DOI BibTeX RDF
15	Gérard Berry, Jean-Jacques Lévy	Minimal and Optimal Computations of Recursive Programs.	POPL	1977	DBLP DOI BibTeX RDF
14	Andrea Maggiolo-Schettini, Barry K. Rosen, H. Raymond Strong	Procedure Linkage Optimization.	POPL	1973	DBLP DOI BibTeX RDF
12	Zena M. Ariola, Aaron Bohannon, Amr Sabry	Sequent calculi and abstract machines.	ACM Trans. Program. Lang. Syst.	2009	DBLP DOI BibTeX RDF	Krivine machine, duality, explicit substitutions, natural deduction, Curry-Howard isomorphism
12	Jacques Carette, Oleg Kiselyov, Chung-chieh Shan	Finally Tagless, Partially Evaluated.	APLAS	2007	DBLP DOI BibTeX RDF
12	Davide Sangiorgi, Naoki Kobayashi 0001, Eijiro Sumii	Logical Bisimulations and Functional Languages.	FSEN	2007	DBLP DOI BibTeX RDF
12	Ian Mackie	Encoding Strategies in the Lambda Calculus with Interaction Nets.	IFL	2005	DBLP DOI BibTeX RDF
12	Paolo Coppola 0001, Ugo Dal Lago, Simona Ronchi Della Rocca	Elementary Affine Logic and the Call-by-Value Lambda Calculus.	TLCA	2005	DBLP DOI BibTeX RDF
12	Andrzej Filinski, Henning Korsholm Rohde	A Denotational Account of Untyped Normalization by Evaluation.	FoSSaCS	2004	DBLP DOI BibTeX RDF
12	Emmanuel Polonowski	Strong Normalization of lambda-mu-mu/tilde-Calculus with Explicit Substitutions.	FoSSaCS	2004	DBLP DOI BibTeX RDF
12	Jerome Vouillon	Subtyping Union Types.	CSL	2004	DBLP DOI BibTeX RDF	semantics, lambda-calculus, subtyping, union types
12	Mads Sig Ager	From Natural Semantics to Abstract Machines.	LOPSTR	2004	DBLP DOI BibTeX RDF
12	Olivier Laurent 0001	Polarized Games.	LICS	2002	DBLP DOI BibTeX RDF
12	Peter Sestoft	Demonstrating Lambda Calculus Reduction.	The Essence of Computation	2002	DBLP DOI BibTeX RDF
12	Maribel Fernández, Ian Mackie	Call-by-Value lambda-Graph Rewriting Without Rewriting.	ICGT	2002	DBLP DOI BibTeX RDF
12	Karim Nour	Mixed logic and storage operators.	Arch. Math. Log.	2000	DBLP DOI BibTeX RDF
12	Pierre-Louis Curien	Abstract Machines, Control, and Sequents.	APPSEM	2000	DBLP DOI BibTeX RDF
12	Peter Dybjer, Andrzej Filinski	Normalization and Partial Evaluation.	APPSEM	2000	DBLP DOI BibTeX RDF
12	Ichiro Ogata	Cut Elimination for Classical Proofs as Continuation Passing Style Computation.	ASIAN	1998	DBLP DOI BibTeX RDF
12	Jens Palsberg	Closure Analysis in Constraint Form.	ACM Trans. Program. Lang. Syst.	1995	DBLP DOI BibTeX RDF	constraints, flow analysis, correctness proof
12	Jens Palsberg	Flobal Program Analysis in Constraint Form.	CAAP	1994	DBLP DOI BibTeX RDF
12	Julia L. Lawall, Olivier Danvy	Separating Stages in the Continuation-Passing Style Transformation.	POPL	1993	DBLP DOI BibTeX RDF	SCHEME
12	John Gateley, Bruce F. Duba	Call-by-Value Combinatory Logic and the Lambda-Value Calculus.	MFPS	1991	DBLP DOI BibTeX RDF
12	John Hannan, Dale Miller 0001	From Operational Semantics to Abstract Machines: Preliminary Results.	LISP and Functional Programming	1990	DBLP DOI BibTeX RDF
12	Alan Mycroft, Flemming Nielson	Strong Abstract Interpretation Using Power Domains (Extended Abstract).	ICALP	1983	DBLP DOI BibTeX RDF
12	Barry K. Rosen	Tree-Manipulating Systems and Church-Rosser Theorems.	J. ACM	1973	DBLP DOI BibTeX RDF
9	Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca	A logical account of pspace.	POPL	2008	DBLP DOI BibTeX RDF	type assignment, linear logic, implicit computational complexity, polynomial space
9	José Espírito Santo, Ralph Matthes, Luís Pinto 0001	Monadic Translation of Intuitionistic Sequent Calculus.	TYPES	2008	DBLP DOI BibTeX RDF
9	Butler W. Lampson	Lazy and speculative execution in computer systems.	ICFP	2008	DBLP DOI BibTeX RDF	lazy evaluation
9	Alexis Saurin	On the Relations between the Syntactic Theories of lambda-mu-Calculi.	CSL	2008	DBLP DOI BibTeX RDF	Classical ?-calculi, ??-calculi, Streams, Type Systems, Confluence, Strong Normalization
9	José Espírito Santo, Ralph Matthes, Luís Pinto 0001	Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi.	TLCA	2007	DBLP DOI BibTeX RDF
9	Luca Cardelli	An Accidental Simula User.	ECOOP	2007	DBLP DOI BibTeX RDF
9	Dale Miller 0001, Alexis Saurin	From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic.	CSL	2007	DBLP DOI BibTeX RDF
9	Butler W. Lampson	Lazy and Speculative Execution in Computer Systems.	OPODIS	2006	DBLP DOI BibTeX RDF
9	Paul-André Melliès, Jerome Vouillon	Recursive Polymorphic Types and Parametricity in an Operational Framework.	LICS	2005	DBLP DOI BibTeX RDF
9	Masahito Hasegawa	Relational Parametricity and Control.	LICS	2005	DBLP DOI BibTeX RDF
9	Gordon D. Plotkin, John Power	Algebraic Operations and Generic Effects.	Appl. Categorical Struct.	2003	DBLP DOI BibTeX RDF	Lawvere theory, monad, computational effect, algebraic operation
9	Gilles Barthe, Tarmo Uustalu	CPS translating inductive and coinductive types.	PEPM	2002	DBLP DOI BibTeX RDF	classical logic and control, inductive and coinductive types, typed ?-calculi, dependent types, CPS translations
9	Tarmo Uustalu	Monad Translating Inductive and Coinductive Types.	TYPES	2002	DBLP DOI BibTeX RDF
9	Harry G. Mairson	From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple.	FSTTCS	2002	DBLP DOI BibTeX RDF
9	Vincent Danos, Russell Harmer	The Anatomy of Innocence.	CSL	2001	DBLP DOI BibTeX RDF
9	Walid Taha	A Sound Reduction Semantics for Untyped CBN Multi-stage Computation. Or, the Theory of MetaML is Non-trivial (Extended Abstract).	PEPM	2000	DBLP DOI BibTeX RDF
9	Elvira Albert, César Ferri, Frank Steiner, Germán Vidal	Improving Functional Logic Programs by Difference-Lists.	ASIAN	2000	DBLP DOI BibTeX RDF	program transformation, compiler optimization, functional logic programming
9	Ferruccio Damiani	Useless-Code Detection and Elimination for PCF with Algebraic Data types.	TLCA	1999	DBLP DOI BibTeX RDF
9	Søren B. Lassen, Andrew Moran	Unique Fixed Point Induction for McCarthy's Amb.	MFCS	1999	DBLP DOI BibTeX RDF
9	Massimo Merro, Davide Sangiorgi	On Asynchrony in Name-Passing Calculi.	ICALP	1998	DBLP DOI BibTeX RDF
9	Gilles Barthe, Fairouz Kamareddine, Alejandro Ríos 0001	Explicit Substitutions for the Lambda-Calculus.	ALP/HOA	1997	DBLP DOI BibTeX RDF
9	Martin Hofmann 0001, Thomas Streicher	Continuation Models are Universal for Lambda-Mu-Calculus.	LICS	1997	DBLP DOI BibTeX RDF
9	Yuxi Fu	A Proof Theoretical Approach to Communication.	ICALP	1997	DBLP DOI BibTeX RDF
9	A. J. Kfoury	Recursion Versus Iteration at Higher-Orders.	FSTTCS	1997	DBLP DOI BibTeX RDF
9	Laurence Puel, Ascánder Suárez	Optimal Solutions to Pattern Matching Problems.	TAPSOFT	1993	DBLP DOI BibTeX RDF
9	Stephen Weeks, Matthias Felleisen	On the Orthogonality of Assignments and Procedures in Algol.	POPL	1993	DBLP DOI BibTeX RDF	ALGOL-60, ALGOL
9	Jon G. Riecke, Ramesh Subrahmanyam	Algebraic Reasoning and Completeness in Typed Languages.	POPL	1993	DBLP DOI BibTeX RDF