Search results for "Call-by-need"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
43	Ronald Garcia, Andrew Lumsdaine, Amr Sabry	Lazy evaluation and delimited control.	POPL	2009	DBLP DOI BibTeX RDF	call-by-need, lambda calculus, abstract machines, delimited continuations, reduction semantics
39	Daniel P. Friedman, Abdulaziz Ghuloum, Jeremy G. Siek, Onnie Lynn Winebarger	Improving the lazy Krivine machine.	High. Order Symb. Comput.	2007	DBLP DOI BibTeX RDF	Call by need, Lambda calculus, Lazy evaluation, Abstract machine
37	John Maraist, Martin Odersky, David N. Turner, Philip Wadler	Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus.	Theor. Comput. Sci.	1999	DBLP DOI BibTeX RDF
37	John Maraist, Martin Odersky, David N. Turner, Philip Wadler	Call-by-name, call-by-value, call-by-need and the linear lambda calculus.	MFPS	1995	DBLP DOI BibTeX RDF
35	Frédéric Lang	Explaining the lazy Krivine machine using explicit substitution and addresses.	High. Order Symb. Comput.	2007	DBLP DOI BibTeX RDF	Call-by-need, Functional programming, Lazy evaluation, Abstract machine
30	Sergio Antoy, Rachid Echahed, Michael Hanus	A needed narrowing strategy.	J. ACM	2000	DBLP DOI BibTeX RDF	call-by-need, narrowing strategies, rewrite systems, functional logic programming languages
28	Zena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler	The Call-by-Need Lambda Calculus.	POPL	1995	DBLP DOI BibTeX RDF
28	Breno Campos Ferreira Guimarães, Fernando Magno Quintão Pereira	Lazy Evaluation for the Lazy: Automatically Transforming Call-by-Value into Call-by-Need.	CC	2023	DBLP DOI BibTeX RDF
28	Jennifer Hackett, Graham Hutton	Call-by-need is clairvoyant call-by-value.	Proc. ACM Program. Lang.	2019	DBLP DOI BibTeX RDF
28	Masayuki Mizuno, Eijiro Sumii	Formal Verifications of Call-by-Need and Call-by-Name Evaluations with Mutual Recursion.	APLAS	2019	DBLP DOI BibTeX RDF
28	Masayuki Mizuno, Eijiro Sumii	Formal Verification of the Correspondence Between Call-by-Need and Call-by-Name.	FLOPS	2018	DBLP DOI BibTeX RDF
28	Manfred Schmidt-Schauß, David Sabel	Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report).	WPTE@RTA/TLCA	2014	DBLP DOI BibTeX RDF
28	Alan Mycroft	The Theory and Practice of Transforming Call-by-need into Call-by-value.	Symposium on Programming	1980	DBLP DOI BibTeX RDF
23	Manfred Schmidt-Schauß, Elena Machkasova	A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case.	RTA	2008	DBLP DOI BibTeX RDF
23	Irène Durand, Aart Middeldorp	On the Modularity of Deciding Call-by-Need.	FoSSaCS	2001	DBLP DOI BibTeX RDF
23	Irène Durand, Aart Middeldorp	Decidable Call by Need Computations in term Rewriting (Extended Abstract).	CADE	1997	DBLP DOI BibTeX RDF
18	Beniamino Accattoli, Adrienne Lancelot	Mirroring Call-by-Need, or Values Acting Silly.	CoRR	2024	DBLP DOI BibTeX RDF
18	Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond	A strong call-by-need calculus.	Log. Methods Comput. Sci.	2023	DBLP DOI BibTeX RDF
18	Manfred Schmidt-Schauß, David Sabel	Program equivalence in a typed probabilistic call-by-need functional language.	J. Log. Algebraic Methods Program.	2023	DBLP DOI BibTeX RDF
18	Malgorzata Biernacka, Witold Charatonik, Tomasz Drab	A simple and efficient implementation of strong call by need by an abstract machine.	Proc. ACM Program. Lang.	2022	DBLP DOI BibTeX RDF
18	David Sabel, Manfred Schmidt-Schauß, Luca Maio	A Probabilistic Call-by-Need Lambda-Calculus - Extended Version.	CoRR	2022	DBLP DOI BibTeX RDF
18	David Sabel, Manfred Schmidt-Schauß, Luca Maio	Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus.	PPDP	2022	DBLP DOI BibTeX RDF
18	Beniamino Accattoli, Maico Leberle	Useful Open Call-By-Need.	CSL	2022	DBLP DOI BibTeX RDF
18	Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond	A strong call-by-need calculus.	CoRR	2021	DBLP BibTeX RDF
18	Beniamino Accattoli, Maico Leberle	Useful Open Call-by-Need.	CoRR	2021	DBLP BibTeX RDF
18	Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond	A Strong Call-By-Need Calculus.	FSCD	2021	DBLP DOI BibTeX RDF
18	Maico Leberle	Dissecting call-by-need by customizing multi type systems. (Une dissection de l'appel-par-nécessité par la personnalisation des systèmes de multi types).		2021	RDF
18	Nils Dallmeyer	Space optimizations in deterministic and concurrent call-by-need functional programming languages.		2020	RDF
18	Davide Sangiorgi	Asynchronous \pi -calculus at Work: The Call-by-Need Strategy.	The Art of Modelling Computational Systems	2019	DBLP DOI BibTeX RDF
18	Malgorzata Biernacka, Witold Charatonik	Deriving an Abstract Machine for Strong Call by Need.	FSCD	2019	DBLP DOI BibTeX RDF
18	Delia Kesner, Alejandro Ríos 0001, Andrés Viso	Call-by-need, neededness and all that.	CoRR	2018	DBLP BibTeX RDF
18	Étienne Miquey, Hugo Herbelin	Realizability Interpretation and Normalization of Typed Call-by-Need λ-calculus With Control.	CoRR	2018	DBLP BibTeX RDF
18	Dylan McDermott, Alan Mycroft	Call-by-need effects via coeffects.	Open Comput. Sci.	2018	DBLP DOI BibTeX RDF
18	George Stelle, Darko Stefanovic	Verifiably Lazy: Verified Compilation of Call-by-Need.	IFL	2018	DBLP DOI BibTeX RDF
18	Étienne Miquey, Hugo Herbelin	Realizability Interpretation and Normalization of Typed Call-by-Need \lambda -calculus with Control.	FoSSaCS	2018	DBLP DOI BibTeX RDF
18	Delia Kesner, Alejandro Ríos 0001, Andrés Viso	Call-by-Need, Neededness and All That.	FoSSaCS	2018	DBLP DOI BibTeX RDF
18	Pablo Barenbaum, Eduardo Bonelli, Kareem Mohamed	Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need: Extended Abstract.	PPDP	2018	DBLP DOI BibTeX RDF
18	Thibaut Balabonski, Pablo Barenbaum, Eduardo Bonelli, Delia Kesner	Foundations of strong call by need.	Proc. ACM Program. Lang.	2017	DBLP DOI BibTeX RDF
18	Koko Muroya, Dan R. Ghica	The Dynamic Geometry of Interaction Machine: A Call-by-need Graph Rewriter.	CoRR	2017	DBLP BibTeX RDF
18	Manfred Schmidt-Schauß, David Sabel	Improvements in a call-by-need functional core language: Common subexpression elimination and resource preserving translations.	Sci. Comput. Program.	2017	DBLP DOI BibTeX RDF
18	Koko Muroya, Dan R. Ghica	The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter.	CSL	2017	DBLP DOI BibTeX RDF
18	Nils Dallmeyer, Manfred Schmidt-Schauß	An Environment for Analyzing Space Optimizations in Call-by-Need Functional Languages.	WPTE@FSCD	2016	DBLP DOI BibTeX RDF
18	David Sabel, Manfred Schmidt-Schauß	A Call-by-Need Lambda Calculus with Scoped Work Decorations.	Software Engineering (Workshops)	2016	DBLP BibTeX RDF
18	Delia Kesner	Reasoning About Call-by-need by Means of Types.	FoSSaCS	2016	DBLP DOI BibTeX RDF
18	George Stelle, Darko Stefanovic, Stephen L. Olivier, Stephanie Forrest	Cactus Environment Machine - Shared Environment Call-by-Need.	TFP	2016	DBLP DOI BibTeX RDF
18	Manfred Schmidt-Schauß, David Sabel, Elena Machkasova	Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq.	Log. Methods Comput. Sci.	2015	DBLP DOI BibTeX RDF
18	Manfred Schmidt-Schauß, David Sabel	Sharing-aware improvements in a call-by-need functional core language.	IFL	2015	DBLP DOI BibTeX RDF
18	Manfred Schmidt-Schauß, David Sabel	Improvements in a functional core language with call-by-need operational semantics.	PPDP	2015	DBLP DOI BibTeX RDF
18	Olivier Danvy, Ian Zerny	A synthetic operational account of call-by-need evaluation.	PPDP	2013	DBLP DOI BibTeX RDF
18	Maximilian C. Bolingbroke	Supercompilation for call-by-need languages.		2013	RDF
18	Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny	On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
18	Stephen Chang 0001, Matthias Felleisen	The Call-by-need Lambda Calculus, Revisited	CoRR	2012	DBLP BibTeX RDF
18	Stephen Chang 0001, Matthias Felleisen	The Call-by-Need Lambda Calculus, Revisited.	ESOP	2012	DBLP DOI BibTeX RDF
18	Zena M. Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata 0001, Alexis Saurin	Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts.	FLOPS	2012	DBLP DOI BibTeX RDF
18	Manfred Schmidt-Schauß, David Sabel, Elena Machkasova	Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
18	Zena M. Ariola, Hugo Herbelin, Alexis Saurin	Classical Call-by-Need and Duality.	TLCA	2011	DBLP DOI BibTeX RDF
18	Conrad Rau, Manfred Schmidt-Schauß	A Unification Algorithm to Compute Overlaps in a Call-by-Need Lambda-Calculus with Variable-Binding Chains.	UNIF	2011	DBLP BibTeX RDF
18	Stephen Chang 0001, David Van Horn, Matthias Felleisen	Evaluating Call-By-Need on the Control Stack	CoRR	2010	DBLP BibTeX RDF
18	Matthias Mann 0001, Manfred Schmidt-Schauß	Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi.	Inf. Comput.	2010	DBLP DOI BibTeX RDF
18	Stephen Chang 0001, David Van Horn, Matthias Felleisen	Evaluating Call-by-Need on the Control Stack.	Trends in Functional Programming	2010	DBLP DOI BibTeX RDF
18	Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny	Defunctionalized Interpreters for Call-by-Need Evaluation.	FLOPS	2010	DBLP DOI BibTeX RDF
18	Manfred Schmidt-Schauß, David Sabel, Elena Machkasova	Simulation in the Call-by-Need Lambda-Calculus with letrec.	RTA	2010	DBLP DOI BibTeX RDF
18	Irène Durand, Aart Middeldorp	On the Complexity of Deciding Call-by-Need	CoRR	2009	DBLP BibTeX RDF
18	Keiko Nakata 0001, Masahito Hasegawa	Small-step and big-step semantics for call-by-need	CoRR	2009	DBLP BibTeX RDF
18	Keiko Nakata 0001, Masahito Hasegawa	Small-step and big-step semantics for call-by-need.	J. Funct. Program.	2009	DBLP DOI BibTeX RDF
18	David Sabel, Manfred Schmidt-Schauß	A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations.	Math. Struct. Comput. Sci.	2008	DBLP DOI BibTeX RDF
18	David Sabel	Semantics of a call-by-need lambda calculus with McCarthy's amb for programm equivalence.		2008	RDF
18	David Sabel	Semantik eines verzögert auswertenden Lambdakalküls mit McCarthy's amb für Programmäquivalenz [Semantics of a Call-by-Need Lambda Calculus with McCarthy's Amb for Program Equivalence].	Ausgezeichnete Informatikdissertationen	2008	DBLP BibTeX RDF
18	Sonia Fagorzi, Elena Zucca	A calculus of open modules: call-by-need strategy and confluence.	Math. Struct. Comput. Sci.	2007	DBLP DOI BibTeX RDF
18	François-Régis Sinot	Call-by-need in token-passing nets.	Math. Struct. Comput. Sci.	2006	DBLP DOI BibTeX RDF
18	François-Régis Sinot	Token-Passing Nets: Call-by-Need for Free.	DCM@ICALP	2005	DBLP DOI BibTeX RDF
18	Irène Durand, Aart Middeldorp	Decidable call-by-need computations in term rewriting.	Inf. Comput.	2005	DBLP DOI BibTeX RDF
18	Irène Durand	Call by need computations in orthogonal term rewriting systems.		2005	RDF
18	Matthias Mann 0001	A non-deterministic call-by-need lambda calculus: proving similarity a precongruence by an extension of Howe's method to sharing.		2005	RDF
18	Matthias Mann 0001	Congruence of Bisimulation in a Non-Deterministic Call-By-Need Lambda Calculus.	SOS@CONCUR	2004	DBLP DOI BibTeX RDF
18	Mads Sig Ager, Olivier Danvy, Jan Midtgaard	A functional correspondence between call-by-need evaluators and lazy abstract machines.	Inf. Process. Lett.	2004	DBLP DOI BibTeX RDF
18	Mizuhito Ogawa	Call-by-need reduction for membership conditional term rewriting Systems.	WRS	2003	DBLP DOI BibTeX RDF
18	Toshiyuki Ishida, Yuichi Kaji	A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2003	DBLP BibTeX RDF
18	Jörgen Gustavsson, David Sands 0001	Possibilities and Limitations of Call-by-Need Space Improvement.	ICFP	2001	DBLP DOI BibTeX RDF
18	Arne Kutzner	Ein nichtdeterministischer call-by-need Lambda-Kalkül mit erratic Choice: operationale Semantik, Programmtransformationen und Anwendungen.		2000	RDF
18	Jörgen Gustavsson, David Sands 0001	A Foundation for Space-Safe Transformations of Call-by-Need Programs.	HOOTS	1999	DBLP DOI BibTeX RDF
18	Andrew Moran, David Sands 0001	Improvement in a Lazy Context: An Operational Theory for Call-by-Need.	POPL	1999	DBLP DOI BibTeX RDF
18	John Maraist, Martin Odersky, Philip Wadler	The Call-by-Need Lambda Calculus.	J. Funct. Program.	1998	DBLP DOI BibTeX RDF
18	Zena M. Ariola, Amr Sabry	Correctness of Monadic State: An Imperative Call-by-Need Calculus.	POPL	1998	DBLP DOI BibTeX RDF	Haskell
18	Arne Kutzner, Manfred Schmidt-Schauß	A Non-Deterministic Call-by-Need Lambda Calculus.	ICFP	1998	DBLP DOI BibTeX RDF
18	Zena M. Ariola, Amr Sabry	Correctness of Monadic State: An Imperative Call-by-Need Calculus.	HOOTS	1997	DBLP DOI BibTeX RDF
18	Zena M. Ariola, Matthias Felleisen	The Call-By-Need lambda Calculus.	J. Funct. Program.	1997	DBLP DOI BibTeX RDF
18	Aart Middeldorp	Call by Need Computations to Root-Stable Form.	POPL	1997	DBLP DOI BibTeX RDF
18	Christian Prehofer	A Call-by-Need Strategy for Higher-Order Functional-Logic Programming.	ILPS	1995	DBLP BibTeX RDF
18	Chris Okasaki, Peter Lee 0001, David Tarditi	Call-by-Need and Continuation-Passing Style.	LISP Symb. Comput.	1994	DBLP BibTeX RDF
18	Richard Kennaway	A Conflict Between Call-by-Need Computation and Parallelism.	CTRS	1994	DBLP DOI BibTeX RDF
18	Michio Oyamaguchi	NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems.	SIAM J. Comput.	1993	DBLP DOI BibTeX RDF
18	F. Warren Burton, Dieter Maurer, Hans-Georg Oberhauser, Reinhard Wilhelm	A Space-Efficient Optimization of Call-by-Need.	IEEE Trans. Software Eng.	1987	DBLP DOI BibTeX RDF
18	Tohru Naoi, Masafumi Yamashita, Toshihide Ibaraki, Namio Honda	A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy.	Syst. Comput. Jpn.	1987	DBLP DOI BibTeX RDF
18	William D. Clinger	Nondeterministic Call by Need is Neither Lazy Nor by Name.	Symposium on LISP and Functional Programming	1982	DBLP DOI BibTeX RDF
16	Manfred Schmidt-Schauß	Correctness of Copy in Calculi with Letrec.	RTA	2007	DBLP DOI BibTeX RDF
16	Torben Æ. Mogensen	Linear Time Self-Interpretation of the Pure Lambda Calculus.	Ershov Memorial Conference	1999	DBLP DOI BibTeX RDF
14	Frank Pfenning	Subtyping and intersection types revisited.	ICFP	2007	DBLP DOI BibTeX RDF
14	David Sands 0001, Jörgen Gustavsson, Andrew Moran	Lambda Calculi and Linear Speedups.	The Essence of Computation	2002	DBLP DOI BibTeX RDF
14	Pietro Cenciarelli	An Algebraic View of Program Composition.	AMAST	1998	DBLP DOI BibTeX RDF