Tag #call-by
89 papers:
POPL-2020-ForsterKR #λ-calculus- The weak call-by-value λ-calculus is reasonable for both time and space (YF0, FK, MR), p. 23.
- POPL-2020-KavvosMLD #functional #source code
- Recurrence extraction for functional programs through call-by-push-value (GAK, EM, DRL, ND), p. 31.
CSL-2020-ChouquetT - Taylor expansion for Call-By-Push-Value (JC, CT), p. 16.
- CSL-2020-Santo #λ-calculus
- The Call-By-Value Lambda-Calculus with Generalized Applications (JES), p. 12.
FSCD-2019-BiernackaC #automaton- Deriving an Abstract Machine for Strong Call by Need (MB, WC), p. 20.
- FSCD-2019-KasterovicP #lazy evaluation #power of #probability #λ-calculus
- The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus (SK, MP), p. 20.
- ICFP-2019-HackettH
- Call-by-need is clairvoyant call-by-value (JH, GH), p. 23.
PEPM-2019-Asai #proving #termination- Extracting a call-by-name partial evaluator from a proof of termination (KA), pp. 61–67.
PPDP-2019-0001S #evaluation #normalisation #λ-calculus- Normalization by Evaluation for Call-By-Push-Value and Polarized Lambda Calculus (AA0, CS), p. 12.
ESOP-2019-McDermottM #evaluation #order #reasoning #source code- Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order (DM, AM), pp. 235–262.
- FSCD-2018-NewL #type system
- Call-by-Name Gradual Type Theory (MSN, DRL), p. 17.
- PPDP-2018-BarenbaumBM #fixpoint #pattern matching
- Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need: Extended Abstract (PB, EB, KM), p. 12.
- ICFP-2017-BalabonskiBBK
- Foundations of strong call by need (TB, PB, EB, DK), p. 29.
- CSL-2017-MuroyaG #geometry #graph grammar #interactive
- The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter (KM, DRG), p. 15.
- PPDP-2016-EhrhardG #λ-calculus
- The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value (TE, GG), pp. 174–187.
- ESOP-2016-Ehrhard #linear #logic #perspective
- Call-By-Push-Value from a Linear Logic Point of View (TE), pp. 202–228.
TLCA-2015-GuerrieriPR #standard #λ-calculus- Standardization of a Call-By-Value λ-Calculus (GG, LP, SRDR), pp. 211–225.
- PPDP-2015-Schmidt-Schauss #functional #semantics
- Improvements in a functional core language with call-by-need operational semantics (MSS, DS), pp. 220–231.
RTA-TLCA-2014-Schmidt-SchaussS #λ-calculus- Applicative May- and Should-Simulation in the Call-by-Value λ Calculus with AMB (MSS, DS), pp. 379–394.
Onward-2014-SamimiDOWM - Call by Meaning (HS, CD, YO, AW, TDM), pp. 11–28.
- PPDP-J-2012-LagoP14 #dependent type #linear
- Linear dependent types in a call-by-value scenario (UDL, BP), pp. 77–100.
- ESOP-2014-CrubilleL #bisimulation #on the #probability #λ-calculus
- On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi (RC, UDL), pp. 209–228.
FoSSaCS-2014-CarraroG #semantics- A Semantical and Operational Account of Call-by-Value Solvability (AC, GG), pp. 103–118.
- FoSSaCS-2014-Tsukada0 #complexity #model checking #source code
- Complexity of Model-Checking Call-by-Value Programs (TT, NK), pp. 180–194.
- PPDP-2013-DanvyZ #evaluation
- A synthetic operational account of call-by-need evaluation (OD, IZ), pp. 97–108.
FLOPS-2012-AccattoliP #revisited- Call-by-Value Solvability, Revisited (BA, LP), pp. 4–16.
- FLOPS-2012-AriolaDHNS #calculus #semantics
- Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts (ZMA, PD, HH, KN, AS), pp. 32–46.
- FLOPS-2012-TanakaK #continuation
- A Call-by-Name CPS Hierarchy (AT, YK), pp. 260–274.
- PPDP-2012-LagoP #dependent type #linear
- Linear dependent types in a call-by-value scenario (UDL, BP), pp. 115–126.
- ESOP-2012-ChangF #revisited #λ-calculus
- The Call-by-Need λ Calculus, Revisited (SC, MF), pp. 128–147.
LICS-2012-Hoshino #combinator #semantics- Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects (NH), pp. 385–394.
- TLCA-2011-AriolaHS
- Classical Call-by-Need and Duality (ZMA, HH, AS), pp. 27–44.
ICALP-v2-2010-Laird #game studies #morphism #polymorphism #semantics- Game Semantics for Call-by-Value Polymorphism (JL), pp. 187–198.
- RTA-2010-Schmidt-SchaussSM #simulation #λ-calculus
- Simulation in the Call-by-Need λ-Calculus with letrec (MSS, DS, EM), pp. 295–310.
- FLOPS-2010-DanvyMMZ #evaluation
- Defunctionalized Interpreters for Call-by-Need Evaluation (OD, KM, JM, IZ), pp. 240–256.
- PPDP-2010-KameyamaT #axiom #equation
- Equational axiomatization of call-by-name delimited control (YK, AT), pp. 77–86.
- FoSSaCS-2010-Saurin #continuation
- A Hierarchy for Delimited Continuations in Call-by-Name (AS), pp. 374–388.
- TLCA-2009-HerbelinZ #deduction #λ-calculus
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form (HH, SZ), pp. 142–156.
- POPL-2009-JonssonN #higher-order #supercompilation
- Positive supercompilation for a higher order call-by-value language (PAJ, JN), pp. 277–288.
- ICALP-B-2008-Lebresne #exception #system f
- A System F with Call-by-Name Exceptions (SL), pp. 323–335.
- RTA-2008-Schmidt-SchaussM #finite #nondeterminism #simulation #λ-calculus
- A Finite Simulation Method in a Non-deterministic Call-by-Need λ-Calculus with Letrec, Constructors, and Case (MSS, EM), pp. 321–335.
- POPL-2008-HerbelinG #approach #continuation
- An approach to call-by-name delimited continuations (HH, SG), pp. 383–394.
- FoSSaCS-2008-SelingerV #λ-calculus
- A Linear-non-Linear Model for a Computational Call-by-Value λ Calculus (PS, BV), pp. 81–96.
ICFP-2007-BrasselHFHV #evaluation #lazy evaluation- Lazy call-by-value evaluation (BB, MH, SF, FH, GV), pp. 265–276.
- ESOP-2006-CooperK #data flow
- Embedding Dynamic Dataflow in a Call-by-Value Language (GHC, SK), pp. 294–308.
- RTA-2005-Rocheteau #λ-calculus #μ-calculus
- λμ-Calculus and Duality: Call-by-Name and Call-by-Value (JR), pp. 204–218.
- RTA-2005-Wadler
- Call-by-Value Is Dual to Call-by-Name — Reloaded (PW), pp. 185–203.
- TLCA-2005-CoppolaLR #logic #λ-calculus
- Elementary Affine Logic and the Call-by-Value λ Calculus (PC, UDL, SRDR), pp. 131–145.
- TLCA-2005-Sinot #interactive
- Call-by-Name and Call-by-Value as Token-Passing Interaction Nets (FRS), pp. 386–400.
- FLOPS-2004-Hasegawa #continuation #linear #semantics
- Semantics of Linear Continuation-Passing in Call-by-Name (MH), pp. 229–243.
- ESOP-2004-HirschowitzLW #mixin #reduction #semantics
- Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types (TH, XL, JBW), pp. 64–78.
- ESOP-2004-Thielecke #continuation #morphism #polymorphism
- Answer Type Polymorphism in Call-by-Name Continuation Passing (HT), pp. 279–293.
- ICFP-2003-Wadler
- Call-by-value is dual to call-by-name (PW), pp. 189–201.
- PPDP-2003-HirschowitzLW #compilation #functional #recursion
- Compilation of extended recursion in call-by-value functional languages (TH, XL, JBW), pp. 160–171.
- FoSSaCS-2003-DunfieldP
- Type Assignment for Intersections and Unions in Call-by-Value Languages (JD, FP), pp. 250–266.
ICGT-2002-FernandezM #graph grammar- Call-by-Value λ-Graph Rewriting Without Rewriting (MF, IM), pp. 75–89.
- ESOP-2002-HirschowitzL #mixin
- Mixin Modules in a Call-by-Value Setting (TH, XL), pp. 6–20.
- CSL-2002-Kakutani #recursion
- Duality between Call-by-Name Recursion and Call-by-Value Iteration (YK), pp. 506–521.
- CSL-2002-Levy #semantics
- Possible World Semantics for General Storage in Call-By-Value (PBL), pp. 232–246.
- ICFP-2001-GustavssonS
- Possibilities and Limitations of Call-by-Need Space Improvement (JG, DS), pp. 265–276.
- FoSSaCS-2001-DurandM #composition #on the
- On the Modularity of Deciding Call-by-Need (ID, AM), pp. 199–213.
- FoSSaCS-2001-HasegawaK #axiom #recursion
- Axioms for Recursion in Call-by-Value (MH, YK), pp. 246–260.
- TLCA-1999-Fujita #morphism #polymorphism #λ-calculus #μ-calculus
- Explicitly Typed λμ-Calculus for Polymorphism an Call-by-Value (KeF), pp. 162–176.
- TLCA-1999-Levy #named #paradigm
- Call-by-Push-Value: A Subsuming Paradigm (PBL), pp. 228–242.
- POPL-1999-MoranS #lazy evaluation
- Improvement in a Lazy Context: An Operational Theory for Call-by-Need (AM, DS), pp. 43–56.
- CSL-1999-KinoshitaP #programming language
- Data-Refinement for Call-By-Value Programming Languages (YK, JP), pp. 562–576.
- ICFP-1998-KutznerS #nondeterminism #λ-calculus
- A Non-Deterministic Call-by-Need λ Calculus (AK, MSS), pp. 324–335.
- POPL-1998-AriolaS #calculus #correctness #imperative #monad
- Correctness of Monadic State: An Imperative Call-by-Need Calculus (ZMA, AS), pp. 62–74.
- ICALP-1997-HondaY #analysis #game studies
- Game Theoretic Analysis of Call-by-Value Computation (KH, NY), pp. 225–236.
- PEPM-1997-AsaiMY #partial evaluation #λ-calculus
- Partial Evaluation of Call-by-Value λ-Calculus with Side-Effects (KA, HM, AY), pp. 12–21.
- POPL-1997-Middeldorp
- Call by Need Computations to Root-Stable Form (AM), pp. 94–105.
CADE-1997-DurandM #decidability #term rewriting- Decidable Call by Need Computations in term Rewriting (ID, AM), pp. 4–18.
- CSL-1997-AbramskyM #game studies
- Call-by-Value Games (SA, GM), pp. 1–17.
- LICS-1997-RieckeS #relational
- A Relational Account of Call-by-Value Sequentiality (JGR, AS), pp. 258–267.
- ICFP-1996-SabryW
- A Reflection on Call-by-Value (AS, PW), pp. 13–24.
- CSL-1996-Stark #logic
- Call-by-Value, Call-by-Name and the Logic of Values (RFS), pp. 431–445.
- TLCA-1995-PravatoRR #category theory #semantics #λ-calculus
- Categorical semantics of the call-by-value λ-calculus (AP, SRDR, LR), pp. 381–396.
- POPL-1995-AriolaFMOW #λ-calculus
- The Call-by-Need λ Calculus (ZMA, MF, JM, MO, PW), pp. 233–246.
SAS-1995-NielsenS - Call-By-Name CPS-Translation as a Binding-Time Improvement (KN, MHS), pp. 296–313.
ILPS-1995-Prehofer #functional #higher-order #logic programming- A Call-by-Need Strategy for Higher-Order Functional-Logic Programming (CP), pp. 147–161.
- POPL-1994-TofteT #implementation #stack #using #λ-calculus
- Implementation of the Typed Call-by-Value λ-Calculus using a Stack of Regions (MT, JPT), pp. 188–201.
- SAS-1994-BanerjeeS #λ-calculus
- Stackability in the Simply-Typed Call-by-Value λ Calculus (AB, DAS), pp. 131–146.
- TLCA-1993-Sieber #nondeterminism
- Call-by-Value and Nondeterminism (KS), pp. 376–390.
- POPL-1993-OderskyRH #λ-calculus
- Call by Name, Assignment, and the λ Calculus (MO, DR, PH), pp. 43–56.
- ICALP-1990-Riecke #decidability #proving
- A Complete and Decidable Proof System for Call-by-Value Equalities (JGR), pp. 20–31.
- LICS-1990-RobinsonR #morphism #polymorphism #set
- Polymorphism, Set Theory, and Call-by-Value (ER, GR), pp. 12–18.
LFP-1982-Clinger #lazy evaluation #nondeterminism- Nondeterministic Call by Need is Neither Lazy Nor by Name (WDC), pp. 226–234.
- ICALP-1979-SethiT #continuation #semantics
- Constructing Call-by-Value Continuation Semantics (RS, AT), pp. 556–570.
- POPL-1977-Lang #evaluation #semantics
- Threshold Evaluation and the Semantics of Call by Value, Assignment and Generic Procedures (BL), pp. 227–237.
