BibSLEIGH — lazy evaluation tag

lazy evaluation

lazy evaluation

Tag #lazy evaluation

303 papers:

ASPLOS-2020-DananjayaGJN: Lazy Release Persistency (MD, VG, AJ, VN), pp. 1173–1186.
FSCD-2019-KasterovicP #call-by #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.
OOPSLA-2019-GoelV #design #implementation #on the #using: On the design, implementation, and use of laziness in R (AG, JV), p. 27.
PLDI-2019-HallahanXBJP #execution #symbolic computation: Lazy counterfactual symbolic execution (WTH, AX, MTB, RJ, RP), pp. 411–424.
ASPLOS-2019-MerrifieldRDE #multi #performance #thread: Lazy Determinism for Faster Deterministic Multithreading (TM, SR, JD, JE), pp. 879–891.
CADE-2019-HavlenaHLV #automaton: Automata Terms in a Lazy WSkS Decision Procedure (VH, LH, OL, TV), pp. 300–318.
VMCAI-2019-FedyukovichGG #effectiveness #functional #synthesis: Lazy but Effective Functional Synthesis (GF, AG, AG), pp. 92–113.
ICFP-2018-FonerZL: Keep your laziness in check (KF, HZ, LL), p. 30.
ICFP-2018-HirschT #monad #semantics #strict: Strict and lazy semantics for effects: layering monads and comonads (AKH, RT), p. 30.
ECOOP-2018-SmaragdakisK #analysis #effectiveness #points-to: Defensive Points-To Analysis: Effective Soundness via Laziness (YS, GK), p. 28.
PPDP-2018-Terao #abstraction #higher-order #verification: Lazy Abstraction for Higher-Order Program Verification (TT), p. 13.
ESEC-FSE-2018-HuaZWK #approach #automation #generative #named #program repair #sketching #using: SketchFix: a tool for automated program repair approach using lazy candidate generation (JH, MZ, KW, SK), pp. 888–891.
ASPLOS-2018-KumarMKVYKBK #named: LATR: Lazy Translation Coherence (MK, SM, SK, JV, ZY, TK, AB, TK), pp. 651–664.
CAV-2018-YangVSGM #composition #security #self #verification: Lazy Self-composition for Security Verification (WY, YV, PS, AG, SM), pp. 136–156.
ICML-2017-LanPZZ #probability: Conditional Accelerated Lazy Stochastic Gradient Descent (GL, SP, YZ, DZ), pp. 1965–1974.
Haskell-2016-DexterLC #graph #haskell: Lazy graph processing in Haskell (PD, YDL, KC), pp. 182–192.
AdaEurope-2016-ThekkilakattilZ #empirical #scheduling: An Empirical Investigation of Eager and Lazy Preemption Approaches in Global Limited Preemptive Scheduling (AT, KZ, YN, RD, SP), pp. 163–178.
PLDI-2016-FaddegonC #functional #lightweight: Lightweight computation tree tracing for lazy functional languages (MF, OC), pp. 114–128.
FSE-2016-CelikKMG #java #retrieval: Build system with lazy retrieval for Java projects (AÇ, AK, AM, MG), pp. 643–654.
ESOP-2016-KawabataI #adaptation #approach #float #refinement: Improving Floating-Point Numbers: A Lazy Approach to Adaptive Accuracy Refinement for Numerical Computations (HK, HI), pp. 390–418.
VMCAI-2016-GanjeiREP #abstraction: Lazy Constrained Monotonic Abstraction (ZG, AR, PE, ZP), pp. 147–165.
ICFP-2015-KarachaliasSVJ #data type #pattern matching: GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness (GK, TS, DV, SLPJ), pp. 424–436.
CIKM-2015-ViegasGMR #classification #documentation #effectiveness #naive bayes #parallel #performance: Parallel Lazy Semi-Naive Bayes Strategies for Effective and Efficient Document Classification (FV, MAG, WM, LCdR), pp. 1071–1080.
ECOOP-2015-Chevalier-Boisvert #effectiveness #version control: Simple and Effective Type Check Removal through Lazy Basic Block Versioning (MCB, MF), pp. 101–123.
SAC-2015-TakanoI #correctness #functional #semantics: Thunk recycling for lazy functional languages: operational semantics and correctness (YT, HI), pp. 2079–2086.
DATE-2015-MadhukarSWKM #abstraction #using #verification: Verifying synchronous reactive systems using lazy abstraction (KM, MS, BW, DK, RM), pp. 1571–1574.
PPoPP-2015-ThomsonD #concurrent #partial order #reduction #testing: The lazy happens-before relation: better partial-order reduction for systematic concurrency testing (PT, AFD), pp. 259–260.
ESOP-2015-VasconcelosJFH #analysis #functional #recursion #type system: Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages (PBV, SJ, MF, KH), pp. 787–811.
FASE-2015-BouajjaniCDM #reachability: Lazy TSO Reachability (AB, GC, ED, RM), pp. 267–282.
TACAS-2015-Nguyen0TP #bound #c #contest #source code: Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches — (Competition Contribution) (TLN, BF, SLT, GP), pp. 461–463.
SAT-2015-MangalZNN #framework #named #satisfiability #scalability: Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances (RM, XZ, AVN, MN), pp. 299–306.
SIGMOD-2014-CheungMS #database #named #query: Sloth: being lazy is a virtue (when issuing database queries) (AC, SM, ASL), pp. 931–942.
SIGMOD-2014-FaleiroTA #database #evaluation #transaction: Lazy evaluation of transactions in database systems (JMF, AT, DJA), pp. 15–26.
PEPM-2014-BransenDS #attribute grammar #incremental: Lazy stateless incremental evaluation machinery for attribute grammars (JB, AD, SDS), pp. 145–156.
POPL-2014-ChangF #profiling: Profiling for laziness (SC, MF), pp. 349–360.
PDP-2014-AraujoGRM #concurrent #evaluation: Afluentes Concurrent I/O Made Easy with Lazy Evaluation (SMdA, KSdG, NSR, SRdLM), pp. 279–287.
PDP-2014-HaeriS #distributed #evaluation #semantics: Distributed Lazy Evaluation: A Big-Step Mechanised Semantics (SHH, SS), pp. 751–755.
TACAS-2014-InversoT0TP #c #contest #named: Lazy-CSeq: A Lazy Sequentialization Tool for C — (Competition Contribution) (OI, ET, BF, SLT, GP), pp. 398–401.
CAV-2014-HadareanBJBT: A Tale of Two Solvers: Eager and Lazy Approaches to Bit-Vectors (LH, KB, DJ, CB, CT), pp. 680–695.
CAV-2014-InversoT0TP #bound #c #concurrent #model checking #multi #source code #thread: Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization (OI, ET, BF, SLT, GP), pp. 585–602.
CAV-2014-McMillan #revisited: Lazy Annotation Revisited (KLM), pp. 243–259.
ICLP-J-2014-AmadiniGM #approach #constraints #named #theorem proving: SUNNY: a Lazy Portfolio Approach for Constraint Solving (RA, MG, JM), pp. 509–524.
SAT-2014-AudemardS #parallel #policy #satisfiability: Lazy Clause Exchange Policy for Parallel SAT Solvers (GA, LS), pp. 197–205.
VLDB-2013-KaraezIZMK: Lazy ETL in Action: ETL Technology Dates Scientific Data (YK, MI, YZ, SM, MLK), pp. 1286–1289.
RTA-2013-Schmidt-SchaussMS #λ-calculus: Extending Abramsky’s Lazy λ Calculus: (Non)-Conservativity of Embeddings (MSS, EM, DS), pp. 239–254.
DUXU-CXC-2013-BaylissVNLB #game studies #visual notation: Lazy Eye Shooter: Making a Game Therapy for Visual Recovery in Adult Amblyopia Usable (JDB, IV, MN, DL, DB), pp. 352–360.
MLDM-2013-PrieditisS: Lazy Overfitting Control (AP, SS), pp. 481–491.
MoDELS-2013-ZurowskaD #composition #model checking #modelling #uml #using: Model Checking of UML-RT Models Using Lazy Composition (KZ, JD), pp. 304–319.
PADL-2013-FourtounisPR #functional #implementation: The Generalized Intensional Transformation for Implementing Lazy Functional Languages (GF, NP, PR), pp. 157–172.
ESEC-FSE-2013-BraioneDP #execution #symbolic computation #term rewriting: Enhancing symbolic execution with built-in term rewriting and constrained lazy initialization (PB, GD, MP), pp. 411–421.
ESOP-2013-Chang: Laziness by Need (SC), pp. 81–100.
CAV-2013-HerbreteauSW #abstraction #automaton: Lazy Abstractions for Timed Automata (FH, BS, IW), pp. 990–1005.
ICFP-2012-Chitil #contract: Practical typed lazy contracts (OC), pp. 67–76.
ICFP-2012-SimoesVFJH #analysis #automation #functional #memory management #source code: Automatic amortised analysis of dynamic memory allocation for lazy functional programs (HRS, PBV, MF, SJ, KH), pp. 165–176.
IFL-2012-ReichNR #roadmap: Advances in Lazy SmallCheck (JSR, MN, CR), pp. 53–70.
IFL-2012-WuMBS #case study #experience #mining: Pure and Lazy λ Mining — An Experience Report (NW, JPM, JB, WS), pp. 207–223.
ECIR-2012-OzcanAU #information management #web: In Praise of Laziness: A Lazy Strategy for Web Information Extraction (RO, ISA, ÖU), pp. 565–568.
PEPM-2012-DegenTW #contract #interactive: The interaction of contracts and laziness (MD, PT, SW), pp. 97–106.
POPL-2012-Balabonski #approach: A unified approach to fully lazy sharing (TB), pp. 469–480.
HPCA-2012-NegiGAGS #hardware #memory management #named #scalability #transaction: π-TM: Pessimistic invalidation for scalable lazy hardware transactional memory (AN, JRTG, MEA, JMG, PS), pp. 141–152.
ICLP-2012-CatDS #incremental: Lazy Model Expansion by Incremental Grounding (BdC, MD, PJS), pp. 201–211.
ICLP-2012-DrescherW #generative #set: Answer Set Solving with Lazy Nogood Generation (CD, TW), pp. 188–200.
ICLP-2012-Hanus #analysis #nondeterminism: Improving Lazy Non-Deterministic Computations by Demand Analysis (MH), pp. 130–143.
VMCAI-2012-FinkbeinerJ #synthesis: Lazy Synthesis (BF, SJ), pp. 219–234.
IFM-J-2009-DovlandJOS11 #behaviour #incremental #inheritance #multi #reasoning #type system: Incremental reasoning with lazy behavioral subtyping for multiple inheritance (JD, EBJ, OO, MS), pp. 915–941.
IFL-2011-ChangBCF #sequence #stack: From Stack Traces to Lazy Rewriting Sequences (SC, EB, JC, MF), pp. 100–115.
IFL-2011-ReichNR #canonical #generative #source code: Lazy Generation of Canonical Test Programs (JSR, MN, CR), pp. 69–84.
KDIR-2011-ArmengolP #case study #classification #information management #learning: Combining Two Lazy Learning Methods for Classification and Knowledge Discovery — A Case Study for Malignant Melanoma Diagnosis (EA, SP), pp. 200–207.
MoDELS-2011-TisiPJC #execution #model transformation: Lazy Execution of Model-to-Model Transformations (MT, SMP, FJ, JC), pp. 32–46.
PEPM-2011-Chitil #semantics: A semantics for lazy assertions (OC), pp. 141–150.
ICSE-2011-GolraD #framework #modelling #multi: The lazy initialization multilayered modeling framework (FRG, FD), pp. 924–927.
TACAS-2011-CimattiNR #abstraction #partial order #reduction: Boosting Lazy Abstraction for SystemC with Partial Order Reduction (AC, IN, MR), pp. 341–356.
CIAA-2010-EpifanioFGMS #graph #on the: On Lazy Representations and Sturmian Graphs (CE, CF, AG, FM, JS), pp. 125–134.
ICFP-2010-BergstromRRSF: Lazy tree splitting (LB, MR, JHR, AS, MF), pp. 93–104.
IFL-2010-BoeijinkHK #functional: Introducing the PilGRIM: A Processor for Executing Lazy Functional Languages (AB, PKFH, JK), pp. 54–71.
ICEIS-AIDSS-2010-LampertiZ: Diagnosis of Active Systems by Lazy Techniques (GL, MZ), pp. 171–180.
PADL-2010-GentMM #constraints: Lazy Explanations for Constraint Propagators (IPG, IM, NCAM), pp. 217–233.
PADL-2010-HafizF #attribute grammar #combinator #execution #specification: Lazy Combinators for Executable Specifications of General Attribute Grammars (RH, RAF), pp. 167–182.
PEPM-2010-Henglein #algebra #equivalence #optimisation #relational #using: Optimizing relational algebra operations using generic equivalence discriminators and lazy products (FH), pp. 73–82.
SAS-2010-JensenMT #analysis #interprocedural: Interprocedural Analysis with Lazy Propagation (SHJ, AM, PT), pp. 320–339.
DATE-2010-GaoM: Enhancing double-patterning detailed routing with lazy coloring and within-path conflict avoidance (XG, LM), pp. 1279–1284.
PPoPP-2010-TzannesCBV #adaptation #runtime: Lazy binary-splitting: a run-time adaptive work-stealing scheduler (AT, GCC, RB, UV), pp. 179–190.
CAV-2010-McMillan #testing #verification: Lazy Annotation for Program Testing and Verification (KLM), pp. 104–118.
CAV-2010-Monniaux #quantifier: Quantifier Elimination by Lazy Model Enumeration (DM), pp. 585–599.
VLDB-2009-CheemaLZWZ #monitoring #performance: Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN (MAC, XL, YZ, WW, WZ), pp. 1138–1149.
SCAM-2009-QianZX #analysis: Improving Side-Effect Analysis with Lazy Access Path Resolving (JQ, YZ, BX), pp. 35–44.
Haskell-2009-Bernardy #functional #incremental #parsing: Lazy functional incremental parsing (JPB), pp. 49–60.
ICFP-2009-FischerKS #functional #nondeterminism #programming: Purely functional lazy non-deterministic programming (SF, OK, CcS), pp. 11–22.
ICFP-2009-Sampson #case study #experience #functional #haskell: Experience report: Haskell in the “real world”: writing a commercial application in a lazy functional language (CJS), pp. 185–190.
PLDI-2009-TristanL #validation: Verified validation of lazy code motion (JBT, XL), pp. 316–326.
POPL-2009-GarciaLS #evaluation: Lazy evaluation and delimited control (RG, AL, AS), pp. 153–164.
LDTA-2008-Dolstra09 #domain-specific language #functional #performance: Maximal Laziness: An Efficient Interpretation Technique for Purely Functional DSLs (ED), pp. 81–99.
ICLP-2009-PaluDPR #constraints #programming #set #using: Answer Set Programming with Constraints Using Lazy Grounding (ADP, AD, EP, GR), pp. 115–129.
FM-2008-DovlandJOS #behaviour #type system: Lazy Behavioral Subtyping (JD, EBJ, OO, MS), pp. 52–67.
FLOPS-2008-Yokouchi #algorithm #analysis #difference #strict: Strictness Analysis Algorithms Based on an Inequality System for Lazy Types (HY), pp. 255–271.
Haskell-2008-RuncimanNL #automation #testing: Smallcheck and lazy smallcheck: automatic exhaustive testing for small values (CR, MN, FL), pp. 37–48.
ICFP-2008-Lampson #execution: Lazy and speculative execution in computer systems (BWL), pp. 1–2.
IFL-2008-BrasselF #functional #logic programming #source code: From Functional Logic Programs to Purely Functional Programs Preserving Laziness (BB, SF), pp. 25–42.
CHI-2008-LaukkanenIR #performance: The cone and the lazy bubble: two efficient alternatives between the point cursor and the bubble cursor (JL, PI, KJR), pp. 309–312.
ICPR-2008-ZhuBQ #learning: Bagging very weak learners with lazy local learning (XZ, CB, WQ), pp. 1–4.
PEPM-2008-HageH: Heap recycling for lazy languages (JH, SH), pp. 189–197.
VMCAI-2008-DimitrovaP #abstraction #protocol #question: Is Lazy Abstraction a Decision Procedure for Broadcast Protocols? (RD, AP), pp. 98–111.
SIGMOD-2007-RamanQHNCYL #adaptation: Lazy, adaptive rid-list intersection, and its application to index anding (VR, LQ, WH, IN, YLC, KHY, FLL), pp. 773–784.
VLDB-2007-ZhouLE #maintenance: Lazy Maintenance of Materialized Views (JZ, PÅL, HGE), pp. 231–242.
CEFP-2007-MolEP #functional #proving #source code: Proving Properties of Lazy Functional Programs with Sparkle (MdM, MCJDvE, RP), pp. 41–86.
ICFP-2007-BrasselHFHV #call-by #evaluation: Lazy call-by-value evaluation (BB, MH, SF, FH, GV), pp. 265–276.
ICFP-2007-MarlowYJ #performance #pointer #using: Faster laziness using dynamic pointer tagging (SM, ARY, SLPJ), pp. 277–288.
IFL-2007-BrasselS #debugging #functional #source code: Debugging Lazy Functional Programs by Asking the Oracle (BB, HS), pp. 183–200.
IFL-2007-FindlerGR #contract #data type: Lazy Contract Checking for Immutable Data Structures (RBF, SyG, AR), pp. 111–128.
LOPSTR-2007-FischerSTV #functional #partial evaluation #source code: Preserving Sharing in the Partial Evaluation of Lazy Functional Programs (SF, JS, ST, GV), pp. 74–89.
POPL-2007-PearlmutterS #higher-order #multi: Lazy multivariate higher-order forward-mode AD (BAP, JMS), pp. 155–160.
PPDP-2007-EncinaLRH #functional #parallel: Observing intermediate structures in a parallel lazy functional language (AdlE, LL, FR, MHH), pp. 109–120.
CC-2007-BakerCPV #garbage collection #pointer: Accurate Garbage Collection in Uncooperative Environments with Lazy Pointer Stacks (JB, AC, FP, JV), pp. 64–79.
SMT-J-2006-GanaiTG #difference #encoding #integration #logic #named: SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in Solving Difference Logic (MKG, MT, AG), pp. 91–114.
CAV-2007-BruttomessoCFGHNPS #industrial #problem #smt #verification: A Lazy and Layered SMT(BV) Solver for Hard Industrial Verification Problems (RB, AC, AF, AG, ZH, AN, AP, RS), pp. 547–560.
CAV-2007-SinhaC #composition #learning #satisfiability #using #verification: SAT-Based Compositional Verification Using Lazy Learning (NS, EMC), pp. 39–54.
VLDB-2006-DaudjeeS #database #replication: Lazy Database Replication with Snapshot Isolation (KD, KS), pp. 715–726.
ICALP-v1-2006-Radhakrishnan #random #using: Gap Amplification in PCPs Using Lazy Random Walks (JR), pp. 96–107.
FLOPS-2006-CasasCH #approach #evaluation #functional #higher-order: A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems (AC, DC, MVH), pp. 146–162.
FLOPS-2006-LiKL #analysis: Lazy Set-Sharing Analysis (XL, AK, LL), pp. 177–191.
IFL-2006-ChitilH #haskell #logic: A Pattern Logic for Prompt Lazy Assertions in Haskell (OC, FH), pp. 126–144.
CIKM-2006-VelosoMCGZ #classification #documentation #multi: Multi-evidence, multi-criteria, lazy associative document classification (AV, WMJ, MC, MAG, MJZ), pp. 218–227.
ICML-2006-ZhengW #performance: Efficient lazy elimination for averaged one-dependence estimators (FZ, GIW), pp. 1113–1120.
TACAS-2006-GanaiTG #encoding #integration #logic #named: SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver (MKG, MT, AG), pp. 135–150.
CAV-2006-BeyerHT #analysis: Lazy Shape Analysis (DB, TAH, GT), pp. 532–546.
CAV-2006-ColvinGLM #algorithm #concurrent #set #verification: Formal Verification of a Lazy Concurrent List-Based Set Algorithm (RC, LG, VL, MM), pp. 475–488.
CAV-2006-McMillan #abstraction: Lazy Abstraction with Interpolants (KLM), pp. 123–136.
IJCAR-2006-Paskevich: Connection Tableaux with Lazy Paramodulation (AP), pp. 112–124.
DocEng-2005-ManakaS #optimisation #parsing #xml: Static optimization of XSLT stylesheets: template instantiation optimization and lazy XML parsing (KM, HS), pp. 55–57.
SIGMOD-2005-CataniaWOW #performance #xml: Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency (BC, WQW, BCO, XW), pp. 515–526.
SIGMOD-2004-AbiteboulBCMMP #evaluation #query #xml: Lazy Query Evaluation for Active XML (SA, OB, BC, IM, TM, NP), pp. 227–238.
ICEIS-v1-2004-Irun-BrizMB #database #distributed #protocol #replication: The Abortion Rate of Lazy Replication Protocols for Distributed Databases (LIB, FDME, JMBA), pp. 130–135.
POPL-2004-Boehm: The space cost of lazy reference counting (HJB), pp. 210–219.
PPDP-2004-Lopez-FraguasRV #calculus #constraints #declarative #programming: A lazy narrowing calculus for declarative constraint programming (FJLF, MRA, RdVV), pp. 43–54.
PPDP-2004-MarinM: New completeness results for lazy conditional narrowing (MM, AM), pp. 120–131.
ICLP-2004-TronconJV #compilation #control flow #evaluation #performance #query: Fast Query Evaluation with (Lazy) Control Flow Compilation (RT, GJ, HV), pp. 240–253.
DocEng-2003-SchottN: Lazy XSL transformations (SS, MLN), pp. 9–18.
Haskell-2003-EnnalsJ #debugging #named #source code: HsDebug: debugging lazy programs by not being lazy (RE, SLPJ), pp. 84–87.
IFL-2003-ChitilMR: Lazy Assertions (OC, DM, CR), pp. 1–19.
ICEIS-v1-2003-Irun-BrizMDB #database #framework #named #replication: COPLA: A Platform for Eager and Lazy Replication in Networked Databases (LIB, FDME, HD, JMBA), pp. 273–278.
ICML-2003-FernB: Boosting Lazy Decision Trees (XZF, CEB), pp. 178–185.
OOPSLA-2003-BoyapatiLSMR #composition #persistent: Lazy modular upgrades in persistent object stores (CB, BL, LS, CHM, SR), pp. 403–417.
PADL-2003-ClareK #data mining #functional #mining: Data Mining the Yeast Genome in a Lazy Functional Language (AC, RDK), pp. 19–36.
CAV-2003-FlanaganJOS #proving #theorem proving #using: Theorem Proving Using Lazy Proof Explication (CF, RJ, XO, JBS), pp. 355–367.
DocEng-2002-NogaSL #xml: Lazy XML processing (MLN, SS, WL), pp. 88–94.
CIAA-2002-GuingneN #finite: Finite State Lazy Operations in NLP (FG, FN), pp. 138–147.
AFP-2002-ClaessenRCHW02 #functional #quickcheck #source code #testing #using: Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat (KC, CR, OC, JH, MW), pp. 59–99.
ICFP-2002-Ford #functional #linear #parsing: Packrat parsing: : simple, powerful, lazy, linear time, functional pearl (BF), pp. 36–47.
IFL-2002-VervoortP #functional: Lazy Dynamic Input/Output in the Lazy Functional Language Clean (MV, MJP), pp. 101–117.
POPL-2002-HenzingerJMS #abstraction: Lazy abstraction (TAH, RJ, RM, GS), pp. 58–70.
CADE-2002-MouraRS #bound #infinity #model checking #proving #theorem proving: Lazy Theorem Proving for Bounded Model Checking over Infinite Domains (LMdM, HR, MS), pp. 438–455.
TLCA-2001-Gianantonio #game studies #semantics #λ-calculus: Game Semantics for the Pure Lazy λ-calculus (PDG), pp. 106–120.
FLOPS-2001-CaballeroLR #debugging #declarative #functional #logic programming #source code: Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs (RC, FJLF, MRA), pp. 170–184.
FLOPS-2001-ChoiLH #compilation #functional #java #source code #virtual machine: Compiling Lazy Functional Programs Based on the Spineless Tagless G-Machine for the Java Virtual Machine (KC, HiL, TH), pp. 92–107.
FLOPS-2001-Hortala-GonzalezU #automaton #calculus: An Abstract Machine Based System for a Lazy Narrowing Calculus (MTHG, EU), pp. 216–232.
FLOPS-2001-SuzukiM: A Complete Selection Function for Lazy Conditional Narrowing (TS, AM), pp. 201–215.
ASE-2001-ChevalierV #protocol #security #verification: A Tool for Lazy Verification of Security Protocols (YC, LV), pp. 373–376.
VLDB-2000-KemmeA #consistency #database #replication: Don’t Be Lazy, Be Consistent: Postgres-R, A New Way to Implement Database Replication (BK, GA), pp. 134–143.
ICFP-2000-Baker-FinchKT #evaluation #parallel #semantics: An operational semantics for parallel lazy evaluation (CABF, DJK, PWT), pp. 162–173.
ICFP-2000-Faxen #evaluation #functional: Cheap eagerness: speculative evaluation in a lazy functional language (KFF), pp. 150–161.
IFL-2000-ChitilRW #comparative #debugging #evaluation #functional #source code: Freja, Hat and Hood — A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs (OC, CR, MW), pp. 176–193.
ICEIS-2000-DawsonS #requirements #specification #using: Requirements Specification for Electronic Services Delivery Applications Using “Lazy Dog” Templates (LD, AS), pp. 261–266.
ICML-2000-WnagZ #approach #learning #multi #problem: Solving the Multiple-Instance Problem: A Lazy Learning Approach (JW, JDZ), pp. 1119–1126.
LOPSTR-2000-EtalleM #functional #logic programming: The lazy functional side of logic programming (SE, JM).
PPDP-2000-BakewellR: A model for comparing the space usage of lazy evaluators (AB, CR), pp. 151–162.
DAC-2000-YangT #model checking: Lazy symbolic model checking (JY, AT), pp. 35–38.
ISMM-2000-ChungM #memory management: Memory Allocation with Lazy Fits (YCC, SMM), pp. 65–70.
ICDAR-1999-DowntonLD #evaluation #recognition: Lazy Evaluation for Best-First Contextual Handwriting Recognition (ACD, SML, LD), pp. 589–592.
VLDB-1999-PacittMS #algorithm #consistency #database #maintenance #performance: Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases (EP, PM, ES), pp. 126–137.
ICALP-1999-Miculan #calculus #formal method #induction #proving #μ-calculus: Formalizing a Lazy Substitution Proof System for μ-calculus in the Calculus of Inductive Constructions (MM), pp. 554–564.
FLOPS-1999-AlpuenteFMV #functional #logic programming #source code: A Transformation System for Lazy Functional Logic Programs (MA, MF, GM, GV), pp. 147–162.
FLOPS-1999-Chakravarty #performance: Lazy Lexing is Fast (MMTC), pp. 68–84.
FLOPS-1999-Lux #encapsulation #functional #implementation #logic: Implementing Encapsulated Search for a Lazy Functional Logic Language (WL), pp. 100–113.
FLOPS-1999-MarinIS #higher-order #on the: On Reducing the Search Space of Higher-Order Lazy Narrowing (MM, TI, TS), pp. 319–334.
ICFP-1999-Nilsson #debugging #functional: Tracing Piece by Piece: Affordable Debugging for Lazy Functional Languages (HN), pp. 36–47.
IFL-1999-Groningen #functional #multi #optimisation #recursion #tuple: Optimising Recursive Functions Yielding Multiple Results in Tuples in a Lazy Functional Language (JHGvG), pp. 59–76.
ICML-1999-ZhengWT #learning #naive bayes: Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees (ZZ, GIW, KMT), pp. 493–502.
PEPM-1999-ChinGK #effectiveness #multi #optimisation #traversal: Effective Optimization of Multiple Traversals in Lazy Languages (WNC, AHG, SCK), pp. 119–130.
POPL-1999-MoranS #call-by: Improvement in a Lazy Context: An Operational Theory for Call-by-Need (AM, DS), pp. 43–56.
HPCA-1999-CoxLHZ #comparison #consistency #memory management #performance #protocol: A Performance Comparison of Homeless and Home-Based Lazy Release Consistency Protocols in Software Shared Memory (ALC, EdL, YCH, WZ), pp. 279–283.
ICFP-1998-EdalatPS: Lazy Computation with Exact Real Numbers (AE, PJP, PS), pp. 185–194.
ICFP-1998-Kiselyov98c: A Lazy CGI Namespace in Scheme (OK), p. 349.
ALP-PLILP-1998-Arenas-SanchezLR #constraints #functional #logic #multi: Embedding Multiset Constraints into a Lazy Functional Logic Language (PAS, FJLF, MRA), pp. 429–444.
ALP-PLILP-1998-Wakeling #compilation #functional #haskell #java #mobile #source code #virtual machine: Mobile Haskell: Compiling Lazy Functional Programs for the Java Virtual Machine (DW), pp. 335–352.
ISMM-1998-WallaceR #functional: The Bits Between The Lambdas: Binary Data in a Lazy Functional Language (MW, CR), pp. 107–117.
ICDAR-1997-DuDLA #documentation #evaluation #recognition #semantics #using: Generalized Contextual Recognition of Hand-Printed Documents Using Semantic Trees with Lazy Evaluation (LD, ACD, SML, BAB), pp. 238–242.
PODS-1997-BreitbartK #consistency #replication: Replication and Consistency: Being Lazy Helps Sometimes (YB, HFK), pp. 173–184.
IFL-1997-Chakravarty #concurrent #parallel #thread: Lazy Thread and Task Creation in Parallel Graph-Reduction (MMTC), pp. 231–249.
IFL-1997-Chitil #functional: Common Subexpressions Are Uncommon in Lazy Functional Languages (OC), pp. 53–71.
ALP-1997-Almendros-JimenezG #order #parametricity: Lazy Narrowing with Parametric Order Sorted Types (JMAJ, AGL), pp. 159–173.
ALP-1997-SuzukiNI #calculus #functional #higher-order #logic: Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language (TS, KN, TI), pp. 99–113.
PEPM-1997-AlpuenteFJV #functional #logic programming #source code: Specialization of Lazy Functional Logic Programs (MA, MF, PJI, GV), pp. 151–162.
PLILP-1997-Patterson #using: Transforming Lazy Functions Using Comportment Properties (RP), pp. 111–125.
PLILP-1997-SparudR #functional #using: Tracing Lazy Functional Computations Using Redex Trails (JS, CR), pp. 291–308.
ILPS-1997-Arenas-SanchezR #algebra #calculus #functional #logic programming #polymorphism: A Lazy Narrowing Calculus for Functional Logic Programming with Algebraic Polymorphic Types (PAS, MRA), pp. 53–67.
ICFP-1996-Okasaki #data type #evaluation: The Role of Lazy Evaluation in Amortized Data Structures (CO), pp. 62–72.
IFL-1996-BoquistJ #functional #optimisation: The GRIN Project: A Highly Optimising Back End for Lazy Functional Languages (UB, TJ), pp. 58–84.
IFL-1996-JarvisM #functional #profiling #scalability #source code: The Results of: Profiling Large-Scale Lazy Functional Programs (SAJ, RGM), pp. 200–221.
SAS-1996-Paterson #compilation #using: Compiling Laziness Using Projections (RP), pp. 255–269.
HPCA-1996-AdveCDRZ #comparison #consistency #implementation: A Comparison of Entry Consistency and Lazy Release Consistency Implementations (SVA, ALC, SD, RR, WZ), pp. 26–37.
TAPSOFT-J-1995-MiddeldorpOI96: Lazy Narrowing: Strong Completeness and Eager Variable Elimination (AM, SO, TI), pp. 95–130.
VLDB-1995-YanL: Eager Aggregation and Lazy Aggregation (WPY, PÅL), pp. 345–357.
RTA-1995-KampermanW: Lazy Rewriting and Eager Machinery (JFTK, HRW), pp. 147–162.
FPCA-1995-Boquist #functional #interprocedural: Interprocedural Register Allocation for Lazy Functional Languages (UB), pp. 270–281.
LOPSTR-1995-Hanus #functional #logic programming #performance #prolog #source code: Efficient Translation of Lazy Functional Logic Programs into Prolog (MH), pp. 252–266.
PLDI-1995-BurgerWD #using: Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling (RGB, OW, RKD), pp. 130–138.
PLILP-1995-Arenas-SanchezG #debugging: A Debugging Model for Lazy Narrowing (PAS, AGL), pp. 453–454.
PLILP-1995-NobleR #component #functional #named #user interface #visual notation: Gadgets: Lazy Functional Components for Graphical User Interfaces (RN, CR), pp. 321–340.
SAS-1995-Faxen #functional #optimisation #source code #using: Optimizing Lazy Functional Programs Using Flow Inference (KFF), pp. 136–153.
IWMM-1995-Hamilton #functional #garbage collection: Compile-Time Garbage Collection for Lazy Functional Languages (GWH), pp. 119–144.
IWMM-1995-Rojemo #functional #garbage collection: Generational Garbage Collection without Temporary Space Leaks for Lazy Functional Languages (NR), pp. 145–162.
ESOP-J-1994-HankinM95 #program analysis #type inference: Lazy Type Inference and Program Analysis (CH, DLM), pp. 219–249.
TAPSOFT-1995-OkuiMI: Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract) (SO, AM, TI), pp. 394–408.
LICS-1995-AbramskyM #abstraction #game studies #λ-calculus: Games and Full Abstraction for the Lazy λ-Calculus (SA, GM), pp. 234–243.
VLDB-1994-FerrandinaMZ #database #implementation: Implementing Lazy Database Updates for an Object Database System (FF, TM, RZ), pp. 261–272.
PLDI-1994-LaunchburyJ #functional #thread: Lazy Functional State Threads (JL, SLPJ), pp. 24–35.
PLILP-1994-Arenas-SanchezGL #constraints: Combining Lazy Narrowing with Disequality Constraints (PAS, AGL, FJLF), pp. 385–399.
PLILP-1994-Hanus: Combining Lazy Narrowing and Simplification (MH), pp. 370–384.
POPL-1994-Maslov #analysis #array #data flow #dependence: Lazy Array Data-Flow Dependence Analysis (VM), pp. 311–325.
ESOP-1994-HankinM #analysis #strict #type inference: Lazy Type Inference for the Strictness Analysis of Lists (CH, DLM), pp. 257–271.
ESOP-1994-Hanus #unification: Lazy Unification with Simplification (MH), pp. 272–286.
STOC-1994-BergDS #incremental #on the #random: On lazy randomized incremental construction (MdB, KD, OS), pp. 105–114.
CADE-1994-Protzen #generative #induction: Lazy Generation of Induction Hypotheses (MP), pp. 42–56.
ICLP-1994-LaunchburyJ #thread: Lazy Funtional State Threads: An Abstract (JL, SLPJ), pp. 3–5.
SIGMOD-1993-JohnsonK #distributed: Lazy Updates for Distributed Search Structure (TJ, PK), pp. 337–346.
FPCA-1993-CarlssonH #functional #named #user interface #visual notation: FUDGETS: A Graphical User Interface in a Lazy Functional Language (MC, TH), pp. 321–330.
FPCA-1993-Gordon #functional #semantics: An Operational Semantics for I/O in a Lazy Functional Language (ADG), pp. 136–145.
FPCA-1993-HartelL #benchmark #functional #implementation #metric: Benchmarking Implementations of Lazy Functional Languages (PHH, KL), pp. 341–349.
FPCA-1993-KozatoO #benchmark #functional #image #metric #source code: Benchmarking Real-Life Image Processing Programs in Lazy Functional Languages (YK, GPO), pp. 18–30.
FPCA-1993-Liu #evaluation #functional #logic #nondeterminism #towards: Towards Lazy Evaluation, Sharing and Non-determinism in Resolution Based Functional Logic Languages (FL), pp. 201–209.
PLILP-1993-LoogenFR: A Demand Driven Computation Strategy for Lazy Narrowing (RL, FJLF, MRA), pp. 184–200.
PLILP-1993-Moreno-NavarroKMWH #analysis #performance #using: Efficient Lazy Narrowing using Demandedness Analysis (JJMN, HK, JMC, SW, WH), pp. 167–183.
POPL-1993-Launchbury #evaluation #semantics: A Natural Semantics for Lazy Evaluation (JL), pp. 144–154.
WSA-1993-Benton #algebra #data type #strict: Strictness Properties of Lazy Algebraic Datatypes (PNB), pp. 206–217.
ILPS-1993-Hanus #normalisation: Combining Lazy Narrowing and Normalization (MH), p. 673.
ICALP-1992-Ong #modelling #λ-calculus: Lazy λ Calculus: Theories, Models and Local Structure Characterization (CHLO), pp. 487–498.
LFP-1992-KaserPRRS #experience #implementation #parallel #performance: Fast Parallel Implementation of Lazy Languages — The EQUALS Experience (OK, SP, CRR, IVR, RCS), pp. 335–344.
LFP-1992-Maranget #compilation #pattern matching: Compiling Lazy Pattern Matching (LM), pp. 21–31.
CSCW-1992-NarayanaswamyG #consistency #development: “Lazy” Consistency: A Basis for Cooperative Software Development (KN, NMG), pp. 257–264.
ML-1992-ClarkH #integration #partial evaluation: Lazy Partial Evaluation: An Integration of Explanation-Based Generalization and Partial Evaluation (PC, RCH), pp. 82–91.
LOPSTR-1992-Jimenez-MartinMM #compilation #performance #prolog: Efficient Compilation of Lazy Narrowing into Prolog (JAJM, JMC, JJMN), pp. 253–270.
PEPM-1992-Chin #higher-order: Fully Lazy Higher-Order Removal (WNC), pp. 38–47.
PLDI-1992-KnoopRS: Lazy Code Motion (JK, OR, BS), pp. 224–234.
PLILP-1992-GomardS #analysis #data type: Path Analysis for Lazy Data Structures (CKG, PS), pp. 54–68.
PLILP-1992-HansLW #backtracking #evaluation #interactive #on the: On the Interaction of Lazy Evaluation and Backtracking (WH, RL, SW), pp. 355–369.
PLILP-1992-NilssonF #algorithm #debugging #functional: Algorithmic Debugging for Lazy Functional Languages (HN, PF), pp. 385–399.
PLILP-1992-Rebelsky #functional #interactive #programming: I/O Trees and Interactive Lazy Functional Programming (SAR), pp. 458–472.
POPL-1992-Jorgensen #compilation #generative #partial evaluation: Generating a Compiler for a Lazy Language by Partial Evaluation (JJ), pp. 258–268.
WSA-1992-Hamilton #analysis #first-order #functional #source code: Sharing Analysis of Lazy First-Order Functional Programs (GWH), pp. 68–78.
WSA-1992-ParkG #analysis: Order-of-Demand Analysis for Lazy Languages (YGP, BG), pp. 91–101.
Best-of-PLDI-1992-KnoopRS92a: Lazy code motion (with retrospective) (JK, OR, BS), pp. 460–472.
SOSP-WIP-1991-Young92 #metadata #named #transaction: Episode: Lazy Transactions for Filesystem Meta-Data Updates (MWY), p. 20.
CC-1992-LangendoenH #code generation #functional #named: FCG: A Code Generator for Lazy Functional Languages (KL, PHH), pp. 278–296.
IWMM-1992-Seward #garbage collection #graph #reduction: Generational Garbage Collection for Lazy Graph Reduction (JS), pp. 200–217.
ESOP-1992-HogenKL #automation #functional #parallel #source code: Automatic Parallelization of Lazy Functional Programs (GH, AK, RL), pp. 254–268.
ESOP-1992-PurushothamanS #evaluation #semantics: An Adequate Operational Semantics for Sharing in Lazy Evaluation (SP, JS), pp. 435–450.
CADE-1992-HasegawaKF #generative #named #parallel #proving #theorem proving: MGTP: A Parallel Theorem Prover Based on Lazy Model Generation (RH, MK, HF), pp. 776–780.
CADE-1992-SekarR #equation #evaluation #framework #parallel #programming: Programming with Equations: A Framework for Lazy Parallel Evaluation (RCS, IVR), pp. 618–632.
JICSLP-1992-KuchenLMR #constraints #functional #implementation #logic: Implementing a Lazy Functional Logic Language with Disequality Constraints (HK, FJLF, JJMN, MRA), pp. 207–221.
LICS-1992-Sangiorgi #concurrent #λ-calculus: The Lazy λ Calculus in a Concurrency Scenario (DS), pp. 102–109.
FPCA-1991-LeungM #reasoning: Reasoning about Simple and Exhaustive Demand in Highter-Order Lazy Languages (AL, PM), pp. 328–351.
FPCA-1991-Maranget #implementation #ml #named #parallel: GAML: a Parallel Implementation of Lazy ML (LM), pp. 102–123.
FPCA-1991-SmetsersNGP #functional #generative #performance: Generating Efficient Code for Lazy Functional Languages (SS, EN, JHGvG, MJP), pp. 592–617.
FPCA-1991-WakelingR: Linearity and Laziness (DW, CR), pp. 215–240.
LOPSTR-1991-Antoy #evaluation #logic programming #nondeterminism: Non-Determinism and Lazy Evaluation in Logic Programming (SA), pp. 318–331.
PEPM-1991-HolstG #partial evaluation: Partial Evaluation is Fuller Laziness (CKH, CKG), pp. 223–233.
PEPM-1991-Takano #functional: Generalized Partial Computation for a Lazy Functional Language (AT), pp. 1–11.
PLILP-1991-Antoy #evaluation #logic: Lazy Evaluation in Logic (SA), pp. 371–382.
PLILP-1991-ChakravartyL #implementation: The Implementation of Lazy Narrowing (MMTC, HCRL), pp. 123–134.
CCPSD-1991-DietrichL #functional #nondeterminism: Exploiting Non-Determinism through Laziness in Guarded Functional Languages (RD, HCRL), pp. 201–216.
LFP-1990-MohrKH #parallel #source code: Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs (EM, DAK, RHHJ), pp. 185–197.
LFP-1990-NielsonN #code generation #information management: Context Information for Lazy Code Generation (HRN, FN), pp. 251–263.
ALP-1990-Moreno-NavarroKLR #graph: Lazy Narrowing in a Graph Machine (JJMN, HK, RL, MRA), pp. 298–317.
PLILP-1990-Asperti #calculus #evaluation #strict: Integrating Strict and Lazy Evaluation: The λ-sl-Calculus (AA), pp. 238–254.
POPL-1990-Field #analysis #on the #specification #tool support: On Laziness and Optimality in λ Interpreters: Tools for Specification and Analysis (JF), pp. 1–15.
ESOP-1990-Kennaway #ambiguity #pattern matching #term rewriting: The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems (RK), pp. 256–270.
ESOP-1990-Sands #analysis #complexity #higher-order: Complexity Analysis for a Lazy Higher-Order Language (DS), pp. 361–376.
LICS-1990-CosmadakisMR: Completeness for typed lazy inequalities (SSC, ARM, JGR), pp. 312–320.
RTA-1989-Narain #nondeterminism #optimisation: Optimization by Non-Deterministic, Lazy Rewriting (SN), pp. 326–342.
FPCA-1989-BjernerH #analysis #approach #composition #first-order #functional #source code: A Composition Approach to Time Analysis of First Order Lazy Functional Programs (BB, SH), pp. 157–165.
SOSP-1989-BarkleyL #bound: A Lazy Buddy System Bounded by Two Coalescing Delays per Class (REB, TPL), pp. 167–176.
LICS-1989-Howe #similarity: Equality In Lazy Computation Systems (DJH), pp. 198–203.
ESOP-1988-Laville #algorithm #implementation #pattern matching: Implementation of Lazy Pattern Matching Algorithms (AL), pp. 298–316.
CSL-1988-Luttringhaus #evaluation #interpreter #prolog: An Interpreter with Lazy Evaluation for Prolog with Functions (SL), pp. 199–225.
JICSCP-1988-GotoKNC88 #garbage collection #incremental #parallel: Lazy Reference Counting: An Incremental Garbage Collection Method for Parallel Inference Machines (AG, YK, TN, TC), pp. 1241–1256.
FPCA-1987-FairbairnW #automaton #combinator #named: TIM: A simple, lazy abstract machine to execute supercombinatorics (JF, SW), pp. 34–45.
CFLP-1987-Finn #evaluation #named: Hoisting: Lazy Evaluation in a Cold Climate (SF), pp. 155–166.
CFLP-1987-GirardL #linear #logic: Linear Logic and Lazy Computation (JYG, YL), pp. 52–66.
FPCA-1985-Hughes85: Lazy Memo-functions (JH), pp. 129–146.
FPCA-1985-Wadler85 #backtracking #exception #functional #how #pattern matching: How to Replace Failure by a List of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages (PW), pp. 113–128.
SLP-1985-Narain85 #evaluation #logic: A Technique for Doing Lazy Evaluation in Logic (SN), pp. 261–269.
LFP-1984-Augustsson #compilation #ml: A Compiler for Lazy ML (LA), pp. 218–227.
LFP-1984-DoschM #infinity: Busy and Lazy FP with Infinite Objects (WD, BM), pp. 282–292.
LFP-1984-Wadler #evaluation #garbage collection: Listlessness is Better than Laziness: Lazy Evaluation and Garbage Collection at Compile Time (PW), pp. 45–52.
POPL-1984-SubrahmanyamY #evaluation #functional #logic programming #reduction #source code: Pattern Driven Lazy Reduction: A Unifying Evaluation Mechanism for Functional and Logic Programs (PAS, JHY), pp. 228–234.
SCC-1984-Johnsson #compilation #evaluation #performance: Efficient compilation of lazy evaluation (TJ), pp. 58–69.
Best-of-PLDI-1984-Johnsson #compilation #evaluation #performance: Efficient compilation of lazy evaluation (with retrospective) (TJ), pp. 125–138.
ILPC-1984-HirakawaCF84 #concurrent #prolog: Eager and Lazy Enumerations in Concurrent Prolog (HH, TC, KF), pp. 89–100.
ICALP-1983-Moller #algebra #data-driven #evaluation #functional #semantics: An Algebraic Semantics for Busy (Data-Driven) and Lazy (Demand-Driven) Evaluation and its Application to a Functional Language (BM), pp. 513–526.
LFP-1982-CartwrightD #evaluation #semantics: The Semantics of Lazy (and Industrious) Evaluation (RC, JED), p. 253–?.
LFP-1982-Clinger #call-by #nondeterminism: Nondeterministic Call by Need is Neither Lazy Nor by Name (WDC), pp. 226–234.
LISP-1980-SteeleS: The Dream of Lifetime: A Lazy Variable Extent Mechanism (GLSJ, GJS), pp. 163–172.
POPL-1976-HendersonM: A Lazy Evaluator (PH, JHMJ), pp. 95–103.