Search results for "Call-by-value"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
72	Paul Blain Levy	Call-by-push-value: Decomposing call-by-value and call-by-name.	High. Order Symb. Comput.	2006	DBLP DOI BibTeX RDF	Call-by-push-value, Call-by-name, Lambda-calculus, Monad, Computational effect, Call-by-value
57	Robert F. Stärk	Call-by-Value, Call-by-Name and the Logic of Values.	CSL	1996	DBLP DOI BibTeX RDF
56	Johan Nordlander, Magnus Carlsson, Andy Gill	Unrestricted pure call-by-value recursion.	ML	2008	DBLP DOI BibTeX RDF	value recursion, semantics, implementation, combinator libraries, call-by-value
51	Kohei Honda 0001, Nobuko Yoshida	Game Theoretic Analysis of Call-by-Value Computation.	ICALP	1997	DBLP DOI BibTeX RDF
49	Daisuke Kimura	Call-by-Value Is Dual to Call-by-Name, Extended.	APLAS	2007	DBLP DOI BibTeX RDF
49	Yoshihiko Kakutani	Duality between Call-by-Name Recursion and Call-by-Value Iteration.	CSL	2002	DBLP DOI BibTeX RDF
48	Peter A. Jonsson, Johan Nordlander	Positive supercompilation for a higher order call-by-value language.	POPL	2009	DBLP DOI BibTeX RDF	deforestation, supercompilation, call-by-value
41	Yoshihiko Kakutani	Call-by-Name and Call-by-Value in Normal Modal Logic.	APLAS	2007	DBLP DOI BibTeX RDF
41	Philip Wadler	Call-by-value is dual to call-by-name.	ICFP	2003	DBLP DOI BibTeX RDF	Curry-Howard correspondence, De Morgan dual, lambda mu calculus, logic, lambda calculus, sequent calculus, natural deduction
37	John Gateley, Bruce F. Duba	Call-by-Value Combinatory Logic and the Lambda-Value Calculus.	MFPS	1991	DBLP DOI BibTeX RDF
34	Luca Paolini	Call-by-Value Separability and Computability.	ICTCS	2001	DBLP DOI BibTeX RDF
33	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
33	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
33	David von Oheimb	Hoare Logic for Mutual Recursion and Local Variables.	FSTTCS	1999	DBLP DOI BibTeX RDF	axiomaticsemantics, relative completeness, local variables, call-by-value parameters, soundness, Hoare logic, Isabelle/HOL, mutual recursion
33	François-Régis Sinot	Call-by-Name and Call-by-Value as Token-Passing Interaction Nets.	TLCA	2005	DBLP DOI BibTeX RDF
33	Jérôme Rocheteau	lambda-µ-Calculus and Duality: Call-by-Name and Call-by-Value.	RTA	2005	DBLP DOI BibTeX RDF
33	Richard J. Fateman, Raymond Toy	Converting call-by-reference to call-by-value: Fortran and Lisp coexisting.	ISSAC	2003	DBLP DOI BibTeX RDF	fortran, lisp, conversion, call
33	Thomas Noll 0001	On the First-Order Equivalence of Call-by-Name and Call-by-Value.	CAAP	1994	DBLP DOI BibTeX RDF
32	Samson Abramsky, Guy McCusker	Call-by-Value Games.	CSL	1997	DBLP DOI BibTeX RDF
31	Ken-etsu Fujita	Polymorphic Call-by-Value Calculus Based on Classical Proofs.	AISC	1998	DBLP DOI BibTeX RDF
31	Amr Sabry, Philip Wadler	A Reflection on Call-by-Value.	ACM Trans. Program. Lang. Syst.	1997	DBLP DOI BibTeX RDF	compiling, continuations, category theory, Galois connections
31	Jon G. Riecke	A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report).	ICALP	1990	DBLP DOI BibTeX RDF
31	Paul Blain Levy	Call-by-Push-Value: A Subsuming Paradigm.	TLCA	1999	DBLP DOI BibTeX RDF
30	Roy Dyckhoff, Stéphane Lengrand	LJQ: A Strongly Focused Calculus for Intuitionistic Logic.	CiE	2006	DBLP DOI BibTeX RDF	purification, call-by-value semantics, depth-bounded, guarded logic, Sequent calculus, focused
30	Anton Setzer	Java as a Functional Programming Language.	TYPES	2002	DBLP DOI BibTeX RDF	object calculi, higher types, algebraic types, state pattern, Java, object-oriented programming, functional programming, Lambda calculus, visitor pattern, initial algebras, call-by-value
30	Ichiro Ogata	A Proof Theoretical Account of Continuation Passing Style.	CSL	2002	DBLP DOI BibTeX RDF	Classical Natural Deduction, LKQ, classical proof theory, Classical Logic, CPS-translation, Call-By-Value
28	Stefano Guerrini, Andrea Masini	Proofs, tests and continuation passing style.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	Minimal logic, call-by-name, intutionistic logic, linear logic, lambda calculus, continuations passing style, call-by-value
25	Yann Régis-Gianas, François Pottier	A Hoare Logic for Call-by-Value Functional Programs.	MPC	2008	DBLP DOI BibTeX RDF
25	Peter Selinger, Benoît Valiron	A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract).	FoSSaCS	2008	DBLP DOI BibTeX RDF
25	Kazuyuki Asada	Extensional Universal Types for Call-by-Value.	APLAS	2008	DBLP DOI BibTeX RDF
25	Tom Hirschowitz, Xavier Leroy, J. B. Wells	Compilation of extended recursion in call-by-value functional languages.	PPDP	2003	DBLP DOI BibTeX RDF	compilation, semantics, recursion, functional languages
25	Malgorzata Biernacka, Dariusz Biernacki	Context-based proofs of termination for typed delimited-control operators.	PPDP	2009	DBLP DOI BibTeX RDF	reducibility predicates, type system, continuation-passing style, delimited continuations, reduction semantics
24	Dylan McDermott, Alan Mycroft	Galois connecting call-by-value and call-by-name.	Log. Methods Comput. Sci.	2024	DBLP DOI BibTeX RDF
24	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
24	Dylan McDermott, Alan Mycroft	Galois connecting call-by-value and call-by-name.	CoRR	2022	DBLP BibTeX RDF
24	Mateusz Pyzik	Call-By-Name Is Just Call-By-Value with Delimited Control.	MFPS	2022	DBLP DOI BibTeX RDF
24	Dylan McDermott, Alan Mycroft	Galois Connecting Call-by-Value and Call-by-Name.	FSCD	2022	DBLP DOI BibTeX RDF
24	Claudia Faggian, Giulio Guerrieri	Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version).	CoRR	2021	DBLP BibTeX RDF
24	Claudia Faggian, Giulio Guerrieri	Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic.	FoSSaCS	2021	DBLP DOI BibTeX RDF
24	Jennifer Hackett, Graham Hutton	Call-by-need is clairvoyant call-by-value.	Proc. ACM Program. Lang.	2019	DBLP DOI BibTeX RDF
24	Thomas Ehrhard, Giulio Guerrieri	The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value.	PPDP	2016	DBLP DOI BibTeX RDF
24	Dariusz Biernacki, Sergueï Lenglet	Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus.	MFPS	2014	DBLP DOI BibTeX RDF
24	Ali Assaf 0002, Alejandro Díaz-Caro, Simon Perdrix, Christine Tasson, Benoît Valiron	Call-by-value, call-by-name and the vectorial behaviour of the algebraic λ-calculus	Log. Methods Comput. Sci.	2014	DBLP DOI BibTeX RDF
24	Daisuke Kimura, Makoto Tatsuta	Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types	Log. Methods Comput. Sci.	2013	DBLP DOI BibTeX RDF
24	Markus Degen 0001, Peter Thiemann 0001, Stefan Wehr	Eager and delayed contract monitoring for call-by-value and call-by-name evaluation.	J. Log. Algebraic Methods Program.	2010	DBLP DOI BibTeX RDF
24	Philip Wadler	Call-by-Value Is Dual to Call-by-Name - Reloaded.	RTA	2005	DBLP DOI BibTeX RDF
24	Stéphane Lengrand	Call-by-value, call-by-name, and strong normalization for the classical sequent calculus.	WRS	2003	DBLP DOI BibTeX RDF
24	Matthew Hennessy	The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment.	SIAM J. Comput.	1980	DBLP DOI BibTeX RDF
24	Alan Mycroft	The Theory and Practice of Transforming Call-by-need into Call-by-value.	Symposium on Programming	1980	DBLP DOI BibTeX RDF
24	Gordon D. Plotkin	Call-by-Name, Call-by-Value and the lambda-Calculus.	Theor. Comput. Sci.	1975	DBLP DOI BibTeX RDF
24	Willem P. de Roever	First-Order Reductions of Call-by-Name to Call-by-Value.	MFCS	1975	DBLP DOI BibTeX RDF
24	Willem P. de Roever	Call-by-Value versus Call-by-Name: A proof-Theoretic Comparison.	MFCS	1974	DBLP DOI BibTeX RDF
24	Roman L. Weil	Testing the understanding of the difference between call by name and call by value in ALGOL 60.	Commun. ACM	1965	DBLP DOI BibTeX RDF	ALGOL
23	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
23	Maribel Fernández, Ian Mackie	Call-by-Value lambda-Graph Rewriting Without Rewriting.	ICGT	2002	DBLP DOI BibTeX RDF
22	Pierre-Louis Curien, Hugo Herbelin	The duality of computation.	ICFP	2000	DBLP DOI BibTeX RDF
21	Ugo Dal Lago, Simone Martini 0001	On Constructor Rewrite Systems and the Lambda-Calculus.	ICALP (2)	2009	DBLP DOI BibTeX RDF
21	Frank Pfenning	Subtyping and intersection types revisited.	ICFP	2007	DBLP DOI BibTeX RDF
21	Søren B. Lassen	Eager Normal Form Bisimulation.	LICS	2005	DBLP DOI BibTeX RDF
21	David Sands 0001, Jörgen Gustavsson, Andrew Moran	Lambda Calculi and Linear Speedups.	The Essence of Computation	2002	DBLP DOI BibTeX RDF
20	Hugo Herbelin, Stéphane Zimmermann	An Operational Account of Call-by-Value Minimal and Classical lambda-Calculus in "Natural Deduction" Form.	TLCA	2009	DBLP DOI BibTeX RDF
20	Bernd Braßel, Michael Hanus, Sebastian Fischer 0001, Frank Huch, Germán Vidal	Lazy call-by-value evaluation.	ICFP	2007	DBLP DOI BibTeX RDF	debugging techniques, laziness
20	Gregory H. Cooper, Shriram Krishnamurthi	Embedding Dynamic Dataflow in a Call-by-Value Language.	ESOP	2006	DBLP DOI BibTeX RDF
20	Tom Hirschowitz, Xavier Leroy, J. B. Wells	Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types.	ESOP	2004	DBLP DOI BibTeX RDF
20	Jana Dunfield, Frank Pfenning	Type Assignment for Intersections and Unions in Call-by-Value Languages.	FoSSaCS	2003	DBLP DOI BibTeX RDF
20	Paul Blain Levy	Possible World Semantics for General Storage in Call-By-Value.	CSL	2002	DBLP DOI BibTeX RDF
20	Masahito Hasegawa, Yoshihiko Kakutani	Axioms for Recursion in Call-by-Value.	FoSSaCS	2001	DBLP DOI BibTeX RDF
20	Ken-etsu Fujita	Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value.	TLCA	1999	DBLP DOI BibTeX RDF
20	Yoshiki Kinoshita, John Power	Data-Refinement for Call-By-Value Programming Languages.	CSL	1999	DBLP DOI BibTeX RDF
20	Kenichi Asai, Hidehiko Masuhara, Akinori Yonezawa	Partial Evaluation of Call-by-Value lambda-Calculus with Side-Effects.	PEPM	1997	DBLP DOI BibTeX RDF
20	Jon G. Riecke, Anders Sandholm 0001	A Relational Account of Call-by-Value Sequentiality.	LICS	1997	DBLP DOI BibTeX RDF
20	Mads Tofte, Jean-Pierre Talpin	Implementation of the Typed Call-by-Value lambda-Calculus using a Stack of Regions.	POPL	1994	DBLP DOI BibTeX RDF
20	Bernard Lang	Threshold Evaluation and the Semantics of Call by Value, Assignment and Generic Procedures.	POPL	1977	DBLP DOI BibTeX RDF
20	Hugo Herbelin, Silvia Ghilezan	An approach to call-by-name delimited continuations.	POPL	2008	DBLP DOI BibTeX RDF	boehm separability, delimited control, observational completeness, classical logic
20	Robert Harper 0001, Mark Lillibridge	Explicit Polymorphism and CPS Conversion.	POPL	1993	DBLP DOI BibTeX RDF
17	Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard	A functional correspondence between evaluators and abstract machines.	PPDP	2003	DBLP DOI BibTeX RDF	transformation into continuation-passing style (CPS), interpreters, abstract machines, defunctionalization, closure conversion
17	Pietro Cenciarelli	An Algebraic View of Program Composition.	AMAST	1998	DBLP DOI BibTeX RDF
15	Sergey Goncharov 0001	Representing Guardedness in Call-by-Value and Guarded Parametrized Monads.	CoRR	2024	DBLP DOI BibTeX RDF
15	Tatsuya Abe 0001, Daisuke Kimura	Extending a Call-by-Value Calculus Based on Bilateralism with Dynamic Binding.	FLAP	2023	DBLP BibTeX RDF
15	Cynthia Kop, Deivid Vale	Complexity Analysis for Call-by-Value Higher-Order Rewriting.	CoRR	2023	DBLP DOI BibTeX RDF
15	Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos	Fully Abstract Normal Form Bisimulation for Call-by-Value PCF.	CoRR	2023	DBLP DOI BibTeX RDF
15	Beniamino Accattoli, Giulio Guerrieri, Maico Leberle	Strong Call-by-Value and Multi Types.	CoRR	2023	DBLP DOI BibTeX RDF
15	Dániel Horpácsi, Péter Bereczky, Simon J. Thompson	Program equivalence in an untyped, call-by-value functional language with uncurried functions.	J. Log. Algebraic Methods Program.	2023	DBLP DOI BibTeX RDF
15	Beniamino Accattoli, Giulio Guerrieri, Maico Leberle	Strong Call-by-Value and Multi Types.	ICTAC	2023	DBLP DOI BibTeX RDF
15	Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos	Fully Abstract Normal Form Bisimulation for Call-by-Value PCF.	LICS	2023	DBLP DOI BibTeX RDF
15	Sergey Goncharov 0001	Representing Guardedness in Call-By-Value.	FSCD	2023	DBLP DOI BibTeX RDF
15	Cynthia Kop, Deivid Vale	Cost-Size Semantics for Call-By-Value Higher-Order Rewriting.	FSCD	2023	DBLP DOI BibTeX RDF
15	Beniamino Accattoli, Giulio Guerrieri	The theory of call-by-value solvability.	Proc. ACM Program. Lang.	2022	DBLP DOI BibTeX RDF
15	Dániel Horpácsi, Péter Bereczky, Simon J. Thompson	Program Equivalence in an Untyped, Call-by-value Lambda Calculus with Uncurried Recursive Functions.	CoRR	2022	DBLP DOI BibTeX RDF
15	Beniamino Accattoli, Giulio Guerrieri	The Theory of Call-by-Value Solvability (long version).	CoRR	2022	DBLP DOI BibTeX RDF
15	Beniamino Accattoli, Giulio Guerrieri	Call-by-Value Solvability and Multi Types.	CoRR	2022	DBLP BibTeX RDF
15	José Espírito Santo, Luís Pinto 0001, Tarmo Uustalu	Plotkin's call-by-value λ-calculus as a modal calculus.	J. Log. Algebraic Methods Program.	2022	DBLP DOI BibTeX RDF
15	Taro Sekiyama, Takeshi Tsukada	CPS transformation with affine types for call-by-value implicit polymorphism.	Proc. ACM Program. Lang.	2021	DBLP DOI BibTeX RDF
15	Beniamino Accattoli, Giulio Guerrieri, Maico Leberle	Semantic Bounds and Strong Call-by-Value Normalization.	CoRR	2021	DBLP BibTeX RDF
15	Malgorzata Biernacka, Witold Charatonik, Tomasz Drab	Strong Call by Value is Reasonable for Time.	CoRR	2021	DBLP BibTeX RDF
15	Beniamino Accattoli, Andrea Condoluci, Claudio Sacerdoti Coen	Strong Call-by-Value is Reasonable, Implosively.	CoRR	2021	DBLP BibTeX RDF
15	Ryu Hasegawa	Complete Call-by-Value Calculi of Control Operators II: Strong Termination.	Log. Methods Comput. Sci.	2021	DBLP BibTeX RDF
15	Frank S. de Boer, Hans-Dieter A. Hiep	Completeness and Complexity of Reasoning about Call-by-Value in Hoare Logic.	ACM Trans. Program. Lang. Syst.	2021	DBLP DOI BibTeX RDF
15	Beniamino Accattoli, Andrea Condoluci, Claudio Sacerdoti Coen	Strong Call-by-Value is Reasonable, Implosively.	LICS	2021	DBLP DOI BibTeX RDF
15	Axel Kerinec, Giulio Manzonetto, Simona Ronchi Della Rocca	Call-By-Value, Again!	FSCD	2021	DBLP DOI BibTeX RDF