Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
43 | Ronald Garcia, Andrew Lumsdaine, Amr Sabry |
Lazy evaluation and delimited control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009, pp. 153-164, 2009, ACM, 978-1-60558-379-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
High. Order Symb. Comput. ![In: High. Order Symb. Comput. 20(3), pp. 271-293, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 228(1-2), pp. 175-210, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFPS ![In: Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, MFPS 1995, Tulane University, New Orleans, LA, USA, March 29 - April 1, 1995, pp. 370-392, 1995, Elsevier. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
35 | Frédéric Lang |
Explaining the lazy Krivine machine using explicit substitution and addresses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
High. Order Symb. Comput. ![In: High. Order Symb. Comput. 20(3), pp. 257-270, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(4), pp. 776-822, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, USA, January 23-25, 1995, pp. 233-246, 1995, ACM Press, 0-89791-692-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CC ![In: Proceedings of the 32nd ACM SIGPLAN International Conference on Compiler Construction, CC 2023, Montréal, QC, Canada, February 25-26, 2023, pp. 239-249, 2023, ACM, 979-8-4007-0088-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Jennifer Hackett, Graham Hutton |
Call-by-need is clairvoyant call-by-value. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 3(ICFP), pp. 114:1-114:23, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Masayuki Mizuno, Eijiro Sumii |
Formal Verifications of Call-by-Need and Call-by-Name Evaluations with Mutual Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems - 17th Asian Symposium, APLAS 2019, Nusa Dua, Bali, Indonesia, December 1-4, 2019, Proceedings, pp. 181-201, 2019, Springer, 978-3-030-34174-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Masayuki Mizuno, Eijiro Sumii |
Formal Verification of the Correspondence Between Call-by-Need and Call-by-Name. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLOPS ![In: Functional and Logic Programming - 14th International Symposium, FLOPS 2018, Nagoya, Japan, May 9-11, 2018, Proceedings, pp. 1-16, 2018, Springer, 978-3-319-90685-0. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WPTE@RTA/TLCA ![In: First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@RTA 2014, July 13, 2014, Vienna, Austria, pp. 63-74, 2014, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-70-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
28 | Alan Mycroft |
The Theory and Practice of Transforming Call-by-need into Call-by-value. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Programming ![In: International Symposium on Programming, Proceedings of the Fourth 'Colloque International sur la Programmation', Paris, France, 22-24 April 1980, pp. 269-281, 1980, Springer, 3-540-09981-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings, pp. 321-335, 2008, Springer, 978-3-540-70588-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Irène Durand, Aart Middeldorp |
On the Modularity of Deciding Call-by-Need. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings, pp. 199-213, 2001, Springer, 3-540-41864-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Irène Durand, Aart Middeldorp |
Decidable Call by Need Computations in term Rewriting (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-14, 14th International Conference on Automated Deduction, Townsville, North Queensland, Australia, July 13-17, 1997, Proceedings, pp. 4-18, 1997, Springer, 3-540-63104-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
18 | Beniamino Accattoli, Adrienne Lancelot |
Mirroring Call-by-Need, or Values Acting Silly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.12078, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond |
A strong call-by-need calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 19(1), 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Manfred Schmidt-Schauß, David Sabel |
Program equivalence in a typed probabilistic call-by-need functional language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Algebraic Methods Program. ![In: J. Log. Algebraic Methods Program. 135, pp. 100904, October 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 6(ICFP), pp. 109-136, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | David Sabel, Manfred Schmidt-Schauß, Luca Maio |
A Probabilistic Call-by-Need Lambda-Calculus - Extended Version. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.14916, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | David Sabel, Manfred Schmidt-Schauß, Luca Maio |
Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: PPDP 2022: 24th International Symposium on Principles and Practice of Declarative Programming, Tbilisi, Georgia, September 20 - 22, 2022, pp. 4:1-4:15, 2022, ACM, 978-1-4503-9703-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Beniamino Accattoli, Maico Leberle |
Useful Open Call-By-Need. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: 30th EACSL Annual Conference on Computer Science Logic, CSL 2022, February 14-19, 2022, Göttingen, Germany (Virtual Conference)., pp. 4:1-4:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-218-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond |
A strong call-by-need calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.01485, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Beniamino Accattoli, Maico Leberle |
Useful Open Call-by-Need. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.06591, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Thibaut Balabonski, Antoine Lanco, Guillaume Melquiond |
A Strong Call-By-Need Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSCD ![In: 6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021, July 17-24, 2021, Buenos Aires, Argentina (Virtual Conference)., pp. 9:1-9:22, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-191-7. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2021 |
RDF |
|
18 | Nils Dallmeyer |
Space optimizations in deterministic and concurrent call-by-need functional programming languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2020 |
RDF |
|
18 | Davide Sangiorgi |
Asynchronous \pi -calculus at Work: The Call-by-Need Strategy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Art of Modelling Computational Systems ![In: The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy - Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday, pp. 33-49, 2019, Springer, 978-3-030-31174-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Malgorzata Biernacka, Witold Charatonik |
Deriving an Abstract Machine for Strong Call by Need. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSCD ![In: 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30, 2019, Dortmund, Germany., pp. 8:1-8:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-107-8. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Delia Kesner, Alejandro Ríos 0001, Andrés Viso |
Call-by-need, neededness and all that. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1801.10519, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
18 | Étienne Miquey, Hugo Herbelin |
Realizability Interpretation and Normalization of Typed Call-by-Need λ-calculus With Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.00914, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
18 | Dylan McDermott, Alan Mycroft |
Call-by-need effects via coeffects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Open Comput. Sci. ![In: Open Comput. Sci. 8(1), pp. 93-108, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | George Stelle, Darko Stefanovic |
Verifiably Lazy: Verified Compilation of Call-by-Need. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFL ![In: Proceedings of the 30th Symposium on Implementation and Application of Functional Languages, IFL 2018, Lowell, MA, USA, September 5-7, 2018., pp. 49-58, 2018, ACM, 978-1-4503-7143-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Étienne Miquey, Hugo Herbelin |
Realizability Interpretation and Normalization of Typed Call-by-Need \lambda -calculus with Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures - 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, pp. 276-292, 2018, Springer, 978-3-319-89365-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Delia Kesner, Alejandro Ríos 0001, Andrés Viso |
Call-by-Need, Neededness and All That. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures - 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, pp. 241-257, 2018, Springer, 978-3-319-89365-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, PPDP 2018, Frankfurt am Main, Germany, September 03-05, 2018, pp. 6:1-6:12, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Thibaut Balabonski, Pablo Barenbaum, Eduardo Bonelli, Delia Kesner |
Foundations of strong call by need. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 1(ICFP), pp. 20:1-20:29, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Koko Muroya, Dan R. Ghica |
The Dynamic Geometry of Interaction Machine: A Call-by-need Graph Rewriter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1703.10027, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. Comput. Program. ![In: Sci. Comput. Program. 147, pp. 3-26, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Koko Muroya, Dan R. Ghica |
The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: 26th EACSL Annual Conference on Computer Science Logic, CSL 2017, August 20-24, 2017, Stockholm, Sweden, pp. 32:1-32:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-045-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Nils Dallmeyer, Manfred Schmidt-Schauß |
An Environment for Analyzing Space Optimizations in Call-by-Need Functional Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WPTE@FSCD ![In: Proceedings Third International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@FSCD 2016, Porto, Portugal, 23rd June 2016., pp. 78-92, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | David Sabel, Manfred Schmidt-Schauß |
A Call-by-Need Lambda Calculus with Scoped Work Decorations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Software Engineering (Workshops) ![In: Gemeinsamer Tagungsband der Workshops der Tagung Software Engineering 2016 (SE 2016), Wien, 23.-26. Februar 2016., pp. 70-90, 2016, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
18 | Delia Kesner |
Reasoning About Call-by-need by Means of Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, pp. 424-441, 2016, Springer, 978-3-662-49629-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | George Stelle, Darko Stefanovic, Stephen L. Olivier, Stephanie Forrest |
Cactus Environment Machine - Shared Environment Call-by-Need. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TFP ![In: Trends in Functional Programming - 17th International Conference, TFP 2016, College Park, MD, USA, June 8-10, 2016, Revised Selected Papers, pp. 24-43, 2016, Springer, 978-3-030-14804-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 11(1), 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Manfred Schmidt-Schauß, David Sabel |
Sharing-aware improvements in a call-by-need functional core language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFL ![In: Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages, IFL '15, Koblenz, Germany, September 14-16, 2015, pp. 6:1-6:12, 2015, ACM, 978-1-4503-4273-5. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Manfred Schmidt-Schauß, David Sabel |
Improvements in a functional core language with call-by-need operational semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, Siena, Italy, July 14-16, 2015, pp. 220-231, 2015, ACM, 978-1-4503-3516-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Olivier Danvy, Ian Zerny |
A synthetic operational account of call-by-need evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: 15th International Symposium on Principles and Practice of Declarative Programming, PPDP '13, Madrid, Spain, September 16-18, 2013, pp. 97-108, 2013, ACM, 978-1-4503-2154-9. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Maximilian C. Bolingbroke |
Supercompilation for call-by-need languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 435, pp. 21-42, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Stephen Chang 0001, Matthias Felleisen |
The Call-by-need Lambda Calculus, Revisited ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1201.3907, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
18 | Stephen Chang 0001, Matthias Felleisen |
The Call-by-Need Lambda Calculus, Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESOP ![In: Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings, pp. 128-147, 2012, Springer, 978-3-642-28868-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLOPS ![In: Functional and Logic Programming - 11th International Symposium, FLOPS 2012, Kobe, Japan, May 23-25, 2012. Proceedings, pp. 32-46, 2012, Springer, 978-3-642-29821-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 111(14), pp. 711-716, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Zena M. Ariola, Hugo Herbelin, Alexis Saurin |
Classical Call-by-Need and Duality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications - 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings, pp. 27-44, 2011, Springer, 978-3-642-21690-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UNIF ![In: Proceedings of the 25th International Workshop on Unification, UNIF 2011, Wroclaw, Poland, July 31, 2011., pp. 35-41, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
18 | Stephen Chang 0001, David Van Horn, Matthias Felleisen |
Evaluating Call-By-Need on the Control Stack ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1009.3174, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 208(3), pp. 276-291, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Stephen Chang 0001, David Van Horn, Matthias Felleisen |
Evaluating Call-by-Need on the Control Stack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trends in Functional Programming ![In: Trends in Functional Programming - 11th International Symposium, TFP 2010, Norman, OK, USA, May 17-19, 2010. Revised Selected Papers, pp. 1-15, 2010, Springer, 978-3-642-22940-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny |
Defunctionalized Interpreters for Call-by-Need Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLOPS ![In: Functional and Logic Programming, 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings, pp. 240-256, 2010, Springer, 978-3-642-12250-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Manfred Schmidt-Schauß, David Sabel, Elena Machkasova |
Simulation in the Call-by-Need Lambda-Calculus with letrec. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010, July 11-13, 2010, Edinburgh, Scottland, UK, pp. 295-310, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-18-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Irène Durand, Aart Middeldorp |
On the Complexity of Deciding Call-by-Need ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0901.0869, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
18 | Keiko Nakata 0001, Masahito Hasegawa |
Small-step and big-step semantics for call-by-need ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0907.4640, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
18 | Keiko Nakata 0001, Masahito Hasegawa |
Small-step and big-step semantics for call-by-need. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Funct. Program. ![In: J. Funct. Program. 19(6), pp. 699-722, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 18(3), pp. 501-553, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | David Sabel |
Semantics of a call-by-need lambda calculus with McCarthy's amb for programm equivalence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
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]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ausgezeichnete Informatikdissertationen ![In: Ausgezeichnete Informatikdissertationen 2008, pp. 221-230, 2008, GI, 978-3-88579-413-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
18 | Sonia Fagorzi, Elena Zucca |
A calculus of open modules: call-by-need strategy and confluence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 17(4), pp. 675-751, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | François-Régis Sinot |
Call-by-need in token-passing nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 16(4), pp. 639-666, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | François-Régis Sinot |
Token-Passing Nets: Call-by-Need for Free. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCM@ICALP ![In: Proceedings of the First International Workshop on Developments in Computational Models, DCM@ICALP 2005, Lisbon, Portugal, July 10, 2005, pp. 129-139, 2005, Elsevier. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Irène Durand, Aart Middeldorp |
Decidable call-by-need computations in term rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 196(2), pp. 95-126, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Irène Durand |
Call by need computations in orthogonal term rewriting systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2005 |
RDF |
|
18 | Matthias Mann 0001 |
Congruence of Bisimulation in a Non-Deterministic Call-By-Need Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOS@CONCUR ![In: Proceedings of the Workshop on Structural Operational Semantics, SOS 2004, London, UK, August 30, 2004, pp. 81-101, 2004, Elsevier. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 90(5), pp. 223-232, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Mizuhito Ogawa |
Call-by-need reduction for membership conditional term rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WRS ![In: 3rd International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2003, Valencia, Spain, June 8, 2003, Final Proceedings, pp. 673-688, 2003, Elsevier. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(12), pp. 3306-3309, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
18 | Jörgen Gustavsson, David Sands 0001 |
Possibilities and Limitations of Call-by-Need Space Improvement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP '01), Firenze (Florence), Italy, September 3-5, 2001., pp. 265-276, 2001, ACM, 1-58113-415-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Arne Kutzner |
Ein nichtdeterministischer call-by-need Lambda-Kalkül mit erratic Choice: operationale Semantik, Programmtransformationen und Anwendungen. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2000 |
RDF |
|
18 | Jörgen Gustavsson, David Sands 0001 |
A Foundation for Space-Safe Transformations of Call-by-Need Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HOOTS ![In: Third Workshop on Higher-Order Operational Techniques in Semantics, HOOTS 1999, Paris, France, September 30 - October 1, 1999, pp. 69-86, 1999, Elsevier. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Andrew Moran, David Sands 0001 |
Improvement in a Lazy Context: An Operational Theory for Call-by-Need. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: POPL '99, Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, TX, USA, January 20-22, 1999, pp. 43-56, 1999, ACM, 1-58113-095-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
18 | John Maraist, Martin Odersky, Philip Wadler |
The Call-by-Need Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Funct. Program. ![In: J. Funct. Program. 8(3), pp. 275-317, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
18 | Zena M. Ariola, Amr Sabry |
Correctness of Monadic State: An Imperative Call-by-Need Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: POPL '98, Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, CA, USA, January 19-21, 1998, pp. 62-74, 1998, ACM, 0-89791-979-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Haskell |
18 | Arne Kutzner, Manfred Schmidt-Schauß |
A Non-Deterministic Call-by-Need Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), Baltimore, Maryland, USA, September 27-29, 1998., pp. 324-335, 1998, ACM, 1-58113-024-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
18 | Zena M. Ariola, Amr Sabry |
Correctness of Monadic State: An Imperative Call-by-Need Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HOOTS ![In: Second Workshop on Higher-Order Operational Techniques in Semantics, HOOTS 1997, Stanford, CA, USA, December 8-12, 1997, pp. 53, 1997, Elsevier. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
18 | Zena M. Ariola, Matthias Felleisen |
The Call-By-Need lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Funct. Program. ![In: J. Funct. Program. 7(3), pp. 265-301, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
18 | Aart Middeldorp |
Call by Need Computations to Root-Stable Form. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, Paris, France, 15-17 January 1997, pp. 94-105, 1997, ACM Press, 0-89791-853-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
18 | Christian Prehofer |
A Call-by-Need Strategy for Higher-Order Functional-Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILPS ![In: Logic Programming, Proceedings of the 1995 International Symposium, Portland, Oregon, USA, December 4-7, 1995, pp. 147-161, 1995, MIT Press, 0-262-62099-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
18 | Chris Okasaki, Peter Lee 0001, David Tarditi |
Call-by-Need and Continuation-Passing Style. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LISP Symb. Comput. ![In: LISP Symb. Comput. 7(1), pp. 57-82, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
18 | Richard Kennaway |
A Conflict Between Call-by-Need Computation and Parallelism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CTRS ![In: Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, Proceedings, pp. 247-261, 1994, Springer, 3-540-60381-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Michio Oyamaguchi |
NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 22(1), pp. 114-135, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
18 | F. Warren Burton, Dieter Maurer, Hans-Georg Oberhauser, Reinhard Wilhelm |
A Space-Efficient Optimization of Call-by-Need. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 13(6), pp. 636-642, 1987. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Syst. Comput. Jpn. ![In: Syst. Comput. Jpn. 18(9), pp. 19-30, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
18 | William D. Clinger |
Nondeterministic Call by Need is Neither Lazy Nor by Name. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on LISP and Functional Programming ![In: Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, LFP 1980, Pittsburgh, PA, USA, August 15-18, 1982., pp. 226-234, 1982, ACM, 0-89791-082-6. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
16 | Manfred Schmidt-Schauß |
Correctness of Copy in Calculi with Letrec. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings, pp. 329-343, 2007, Springer, 978-3-540-73447-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Torben Æ. Mogensen |
Linear Time Self-Interpretation of the Pure Lambda Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ershov Memorial Conference ![In: Perspectives of System Informatics, Third International Andrei Ershov Memorial Conference, PSI'99, Akademgorodok, Novosibirsk, Russia, July 6-9, 1999, Proceedings, pp. 128-142, 1999, Springer, 3-540-67102-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
14 | Frank Pfenning |
Subtyping and intersection types revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, ICFP 2007, Freiburg, Germany, October 1-3, 2007, pp. 219, 2007, ACM, 978-1-59593-815-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
14 | David Sands 0001, Jörgen Gustavsson, Andrew Moran |
Lambda Calculi and Linear Speedups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Essence of Computation ![In: The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday], pp. 60-84, 2002, Springer, 3-540-00326-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
14 | Pietro Cenciarelli |
An Algebraic View of Program Composition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMAST ![In: Algebraic Methodology and Software Technology, 7th International Conference, AMAST '98, Amazonia, Brasil, January 4-8, 1999, Proceedings, pp. 325-340, 1998, Springer, 3-540-65462-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|