Search results for "Call-by-name"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
79	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
68	Robert F. Stärk	Call-by-Value, Call-by-Name and the Logic of Values.	CSL	1996	DBLP DOI BibTeX RDF
65	Daisuke Kimura	Call-by-Value Is Dual to Call-by-Name, Extended.	APLAS	2007	DBLP DOI BibTeX RDF
65	Yoshihiko Kakutani	Duality between Call-by-Name Recursion and Call-by-Value Iteration.	CSL	2002	DBLP DOI BibTeX RDF
53	Yoshihiko Kakutani	Call-by-Name and Call-by-Value in Normal Modal Logic.	APLAS	2007	DBLP DOI BibTeX RDF
53	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
52	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
46	Masahito Hasegawa	Semantics of Linear Continuation-Passing in Call-by-Name.	FLOPS	2004	DBLP DOI BibTeX RDF
42	Kohei Honda 0001, Nobuko Yoshida	Game Theoretic Analysis of Call-by-Value Computation.	ICALP	1997	DBLP DOI BibTeX RDF
41	François-Régis Sinot	Call-by-Name and Call-by-Value as Token-Passing Interaction Nets.	TLCA	2005	DBLP DOI BibTeX RDF
41	Jérôme Rocheteau	lambda-µ-Calculus and Duality: Call-by-Name and Call-by-Value.	RTA	2005	DBLP DOI BibTeX RDF
41	Thomas Noll 0001	On the First-Order Equivalence of Call-by-Name and Call-by-Value.	CAAP	1994	DBLP DOI BibTeX RDF
41	S. Kamal Abdali, David S. Wise	Standard, Storeless Semantics for ALGOL-Style Block Structure and Call-by Name.	Mathematical Foundations of Programming Semantics	1985	DBLP DOI BibTeX RDF
39	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
39	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
38	Hayo Thielecke	Answer Type Polymorphism in Call-by-Name Continuation Passing.	ESOP	2004	DBLP DOI BibTeX RDF
37	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
35	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
33	Paul Blain Levy	Call-by-Push-Value: A Subsuming Paradigm.	TLCA	1999	DBLP DOI BibTeX RDF
32	Bruno Monsuez	Polymorphic Typing for Call-by-Name Semantics.	Formal Methods in Programming and Their Applications	1993	DBLP DOI BibTeX RDF
32	Robert Harper 0001, Mark Lillibridge	Explicit Polymorphism and CPS Conversion.	POPL	1993	DBLP DOI BibTeX RDF
30	Dylan McDermott, Alan Mycroft	Galois connecting call-by-value and call-by-name.	Log. Methods Comput. Sci.	2024	DBLP DOI BibTeX RDF
30	Dylan McDermott, Alan Mycroft	Galois connecting call-by-value and call-by-name.	CoRR	2022	DBLP BibTeX RDF
30	Mateusz Pyzik	Call-By-Name Is Just Call-By-Value with Delimited Control.	MFPS	2022	DBLP DOI BibTeX RDF
30	Dylan McDermott, Alan Mycroft	Galois Connecting Call-by-Value and Call-by-Name.	FSCD	2022	DBLP DOI BibTeX RDF
30	Claudia Faggian, Giulio Guerrieri	Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version).	CoRR	2021	DBLP BibTeX RDF
30	Claudia Faggian, Giulio Guerrieri	Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic.	FoSSaCS	2021	DBLP DOI BibTeX RDF
30	Masayuki Mizuno, Eijiro Sumii	Formal Verifications of Call-by-Need and Call-by-Name Evaluations with Mutual Recursion.	APLAS	2019	DBLP DOI BibTeX RDF
30	Masayuki Mizuno, Eijiro Sumii	Formal Verification of the Correspondence Between Call-by-Need and Call-by-Name.	FLOPS	2018	DBLP DOI BibTeX RDF
30	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
30	Dariusz Biernacki, Sergueï Lenglet	Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus.	MFPS	2014	DBLP DOI BibTeX RDF
30	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
30	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
30	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
30	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
30	Philip Wadler	Call-by-Value Is Dual to Call-by-Name - Reloaded.	RTA	2005	DBLP DOI BibTeX RDF
30	Stéphane Lengrand	Call-by-value, call-by-name, and strong normalization for the classical sequent calculus.	WRS	2003	DBLP DOI BibTeX RDF
30	Matthew Hennessy	The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment.	SIAM J. Comput.	1980	DBLP DOI BibTeX RDF
30	Gordon D. Plotkin	Call-by-Name, Call-by-Value and the lambda-Calculus.	Theor. Comput. Sci.	1975	DBLP DOI BibTeX RDF
30	Willem P. de Roever	First-Order Reductions of Call-by-Name to Call-by-Value.	MFCS	1975	DBLP DOI BibTeX RDF
30	Willem P. de Roever	Call-by-Value versus Call-by-Name: A proof-Theoretic Comparison.	MFCS	1974	DBLP DOI BibTeX RDF
30	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
29	Sylvain Lebresne	A System F with Call-by-Name Exceptions.	ICALP (2)	2008	DBLP DOI BibTeX RDF
29	Martin Odersky, Dan Rabin, Paul Hudak	Call by Name, Assignment, and the Lambda Calculus.	POPL	1993	DBLP DOI BibTeX RDF
27	Pierre-Louis Curien, Hugo Herbelin	The duality of computation.	ICFP	2000	DBLP DOI BibTeX RDF
23	Manfred Schmidt-Schauß	Correctness of Copy in Calculi with Letrec.	RTA	2007	DBLP DOI BibTeX RDF
23	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
23	Samson Abramsky, Guy McCusker	Call-by-Value Games.	CSL	1997	DBLP DOI BibTeX RDF
20	Ryosuke Sato 0001	Refinement Types for Call-by-name Programs.	J. Inf. Process.	2023	DBLP DOI BibTeX RDF
20	José Espírito Santo, Maria João Frade, Luís Pinto 0001	Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications.	J. Log. Algebraic Methods Program.	2023	DBLP DOI BibTeX RDF
20	Ugo Dal Lago, Francesco Gavazzo, Ryo Tanaka	Effectful applicative similarity for call-by-name lambda calculi.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
20	Mathys Rennela	Convexity and Order in Probabilistic Call-by-Name FPC.	Log. Methods Comput. Sci.	2020	DBLP BibTeX RDF
20	Max S. New, Daniel R. Licata	Call-by-name Gradual Type Theory.	Log. Methods Comput. Sci.	2020	DBLP DOI BibTeX RDF
20	Gianluca Curzi, Michele Pagani	The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name.	LICS	2020	DBLP DOI BibTeX RDF
20	Kenichi Asai	Extracting a call-by-name partial evaluator from a proof of termination.	PEPM@POPL	2019	DBLP DOI BibTeX RDF
20	Simona Kasterovic, Michele Pagani	The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus.	FSCD	2019	DBLP DOI BibTeX RDF
20	Max S. New, Daniel R. Licata	Call-by-name Gradual Type Theory.	CoRR	2018	DBLP BibTeX RDF
20	Max S. New, Daniel R. Licata	Call-by-Name Gradual Type Theory.	FSCD	2018	DBLP DOI BibTeX RDF
20	Keishi Watanabe, Shin-ya Nishizaki	Big-step and Small-Step Semantics of the Call-by-Name RPC Calculus.	J. Softw.	2017	DBLP DOI BibTeX RDF
20	Philip Johnson-Freyd, Paul Downen, Zena M. Ariola	Call-by-name extensionality and confluence.	J. Funct. Program.	2017	DBLP DOI BibTeX RDF
20	Ugo Dal Lago, Francesco Gavazzo, Ryo Tanaka	Effectful Applicative Similarity for Call-by-Name Lambda Calculi.	ICTCS/CILC	2017	DBLP BibTeX RDF
20	Mathys Rennela	Convexity and Order in Probabilistic Call-by-Name FPC.	CoRR	2016	DBLP BibTeX RDF
20	Antonina Nepeivoda	Turchin's Relation for Call-by-Name Computations: A Formal Approach.	VPT@ETAPS	2016	DBLP DOI BibTeX RDF
20	Yoshihiko Kakutani, Daisuke Kimura	Induction by Coinduction and Control Operators in Call-by-Name.	COS	2013	DBLP DOI BibTeX RDF
20	Leonardo Rodríguez, Daniel Fridlender, Miguel Pagano	A Certified Extension of the Krivine Machine for a Call-by-Name Higher-Order Imperative Language.	TYPES	2013	DBLP DOI BibTeX RDF
20	Asami Tanaka, Yukiyoshi Kameyama	A Call-by-Name CPS Hierarchy.	FLOPS	2012	DBLP DOI BibTeX RDF
20	Benedikt Meurer	A Step-indexed Semantic Model of Types for the Call-by-Name Lambda Calculus	CoRR	2011	DBLP BibTeX RDF
20	Alexis Saurin	A Hierarchy for Delimited Continuations in Call-by-Name.	FoSSaCS	2010	DBLP DOI BibTeX RDF
20	Yukiyoshi Kameyama, Asami Tanaka	Equational axiomatization of call-by-name delimited control.	PPDP	2010	DBLP DOI BibTeX RDF
20	Sylvain Lebresne	A Type System For Call-By-Name Exceptions	Log. Methods Comput. Sci.	2009	DBLP BibTeX RDF
20	Kentaro Kikuchi	Call-by-name reduction and cut-elimination in classical logic.	Ann. Pure Appl. Log.	2008	DBLP DOI BibTeX RDF
20	Elena Machkasova	Computational Soundness of a Call by Name Calculus of Recursively-scoped Records.	WRS@RDP	2007	DBLP DOI BibTeX RDF
20	Jean-Louis Krivine	A call-by-name lambda-calculus machine.	High. Order Symb. Comput.	2007	DBLP DOI BibTeX RDF	Lambda-calculus machine, Control instruction, Curry-Howard correspondence
20	Vladimir Komendantsky	Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus.	MFCSIT	2006	DBLP DOI BibTeX RDF
20	Andrzej S. Murawski	Games for complexity of second-order call-by-name programs.	Theor. Comput. Sci.	2005	DBLP DOI BibTeX RDF
20	Gérard Boudol	On the semantics of the call-by-name CPS transform.	Theor. Comput. Sci.	2000	DBLP DOI BibTeX RDF
20	María Alpuente, Moreno Falaschi, Pascual Julián Iranzo, Germán Vidal	Call-By Name Partial Evaluation of Functional Logic Programs.	APPIA-GULP-PRODE	1996	DBLP BibTeX RDF
20	Kristian Nielsen, Morten Heine Sørensen	Call-By-Name CPS-Translation as a Binding-Time Improvement	SAS	1995	DBLP DOI BibTeX RDF
20	Jean-Louis Krivine	A General Storage Theorem for Integers in Call-by-Name lambda-Calculus.	Theor. Comput. Sci.	1994	DBLP DOI BibTeX RDF
20	Paul Hudak, Jonathan Young	A Collecting Interpretation of Expressions (Without Powerdomains). (long version: TOPLAS 13(2): 269-290 (1991))	POPL	1988	DBLP DOI BibTeX RDF
20	Neil D. Jones, Steven S. Muchnick	Even Simple Programs are Hard to Analyze.	POPL	1975	DBLP DOI BibTeX RDF
19	Tatsuya Abe 0001	A Concurrent System of Multi-ported Processes with Causal Dependency.	APLAS	2004	DBLP DOI BibTeX RDF
18	Frank Pfenning	Subtyping and intersection types revisited.	ICFP	2007	DBLP DOI BibTeX RDF
18	David Sands 0001, Jörgen Gustavsson, Andrew Moran	Lambda Calculi and Linear Speedups.	The Essence of Computation	2002	DBLP DOI BibTeX RDF
18	Luca Paolini	Call-by-Value Separability and Computability.	ICTCS	2001	DBLP DOI BibTeX RDF
18	Torben Æ. Mogensen	Linear Time Self-Interpretation of the Pure Lambda Calculus.	Ershov Memorial Conference	1999	DBLP DOI BibTeX RDF
18	Pietro Cenciarelli	An Algebraic View of Program Composition.	AMAST	1998	DBLP DOI BibTeX RDF
17	Martin Berger 0001, Kohei Honda 0001, Nobuko Yoshida	Sequentiality and the pi-Calculus.	TLCA	2001	DBLP DOI BibTeX RDF
17	Peter W. O'Hearn, Jon G. Riecke	Fully Abstract Translations and Parametric Polymorphism.	ESOP	1994	DBLP DOI BibTeX RDF
17	Willem P. de Roever	Recursion and Parameter Mechanisms: An Axiomatic Approach.	ICALP	1974	DBLP DOI BibTeX RDF
15	Frank Pfenning, Robert J. Simmons	Substructural Operational Semantics as Ordered Logic Programming.	LICS	2009	DBLP DOI BibTeX RDF
15	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
15	Raffaella Bernardi, Michael Moortgat	Continuation Semantics for Symmetric Categorial Grammar.	WoLLIC	2007	DBLP DOI BibTeX RDF
15	Davide Sangiorgi, Naoki Kobayashi 0001, Eijiro Sumii	Environmental Bisimulations for Higher-Order Languages.	LICS	2007	DBLP DOI BibTeX RDF
15	Alex K. Simpson	Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics.	RTA	2005	DBLP DOI BibTeX RDF
15	Tom Hirschowitz	Rigid Mixin Modules.	FLOPS	2004	DBLP DOI BibTeX RDF
15	Harry G. Mairson	From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis.	ICFP	2003	DBLP DOI BibTeX RDF
15	Jens P. Secher	Driving in the Jungle.	PADO	2001	DBLP DOI BibTeX RDF
15	Jeffrey R. Lewis, John Launchbury, Erik Meijer 0001, Mark Shields	Implicit Parameters: Dynamic Scoping with Static Types.	POPL	2000	DBLP DOI BibTeX RDF
15	Julia L. Lawall, Harry G. Mairson	Sharing Continuations: Proofnets for Languages with Explicit Control.	ESOP	2000	DBLP DOI BibTeX RDF