20 papers:
- IJCAR-2010-Schack-NielsenS #linear #λ-calculus
- Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus (ASN, CS), pp. 1–14.
- DATE-2005-AmatoCMP #precise
- Realization of a Virtual Lambda Sensor on a Fixed Precision System (PA, NC, MDM, FP), pp. 192–197.
- IJCAR-2004-Beeson #logic
- Lambda Logic (MB), pp. 460–474.
- VMCAI-2002-MurawskiY #analysis
- Static Monotonicity Analysis for lambda-definable Functions over Lattices (ASM, KY), pp. 139–153.
- SIGMOD-2000-FegarasSRM #named #object-oriented
- lambda-DB: An ODMG-Based Object-Oriented DBMS (LF, CS, AR, DM), p. 583.
- CADE-1999-NadathurM #automaton #compilation #implementation #prolog #λ-calculus
- System Description: Teyjus — A Compiler and Abstract Machine Based Implementation of lambda-Prolog (GN, DJM), pp. 287–291.
- ISMM-1998-WallaceR #functional #lazy evaluation
- The Bits Between The Lambdas: Binary Data in a Lazy Functional Language (MW, CR), pp. 107–117.
- CADE-1998-Beeson #unification #λ-calculus
- Unification in Lambda-Calculi with if-then-else (MB), pp. 103–118.
- CADE-1998-RichardsonSG #higher-order #logic #proving #theorem proving
- System Description: Proof Planning in Higher-Order Logic with Lambda-Clam (JR, AS, IG), pp. 129–133.
- CADE-1997-HutterK #λ-calculus
- A Colored Version of the Lambda-Calculus (DH, MK), pp. 291–305.
- DAC-1995-ShenHC #composition #set
- Lambda Set Selection in Roth-Karp Decomposition for LUT-Based FPGA Technology Mapping (WZS, JDH, SMC), pp. 65–69.
- PODS-1994-HillebrandK #database #functional #order #query #λ-calculus
- Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (GGH, PCK), pp. 222–231.
- CADE-1994-JohannK #constant #order #unification #λ-calculus
- Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading (PJ, MK), pp. 620–634.
- CADE-1992-NipkowQ #reduction #type system #unification #λ-calculus
- Reduction and Unification in Lambda Calculi with Subtypes (TN, ZQ), pp. 66–78.
- CADE-1990-FeltyGMP #prolog #tutorial #λ-calculus
- Tutorial on Lambda-Prolog (APF, ELG, DM, FP), p. 682.
- CADE-1990-FeltyM #encoding #logic programming #programming language #λ-calculus
- Encoding a Dependent-Type Lambda-Calculus in a Logic Programming Language (APF, DM), pp. 221–235.
- CADE-1988-FeltyGHMNS #logic programming #named #programming language #prolog #λ-calculus
- Lambda-Prolog: An Extended Logic Programming Language (APF, ELG, JH, DM, GN, AS), pp. 754–755.
- DAC-1982-MatsudaFTMNKG #design #layout #low cost #named
- LAMBDA: A quick, low cost layout design system for master-slice LSI s (TM, TF, KT, HM, HN, FK, SG), pp. 802–808.
- LFP-1982-ReesA #lisp #named
- T: A Dialect of Lisp or, LAMBDA: The Ultimate Software Tool (JR, NA), pp. 114–122.
- CADE-1980-Nederpelt #approach #proving #theorem proving #λ-calculus
- An Approach to Theorem Proving on the Basis of a Typed Lambda-Calculus (RN), pp. 182–194.