39 papers:
- TLCA-2015-Scherer #multi
- Multi-Focusing on Extensional Rewriting with Sums (GS), pp. 317–331.
- KR-2014-CharalambidisR #higher-order #logic programming
- Constructive Negation in Extensional Higher-Order Logic Programming (AC, PR).
- ICLP-J-2014-CharalambidisER #higher-order #logic programming #semantics
- Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation (AC, ZÉ, PR), pp. 725–737.
- RTA-TLCA-2014-NakazawaN #reduction #λ-calculus #μ-calculus
- Reduction System for Extensional Λμ Calculus (KN, TN), pp. 349–363.
- CSL-2013-KrishnaswamiD #calculus #parametricity #relational
- Internalizing Relational Parametricity in the Extensional Calculus of Constructions (NRK, DD), pp. 432–451.
- LICS-2009-CarraroS #reflexive #λ-calculus
- Reflexive Scott Domains are Not Complete for the Extensional λ Calculus (AC, AS), pp. 91–100.
- TLCA-2009-AwodeyR #semantics #type system
- Kripke Semantics for Martin-Löf’s Extensional Type Theory (SA, FR), pp. 249–263.
- CSL-2008-McKenzieTV
- Extensional Uniformity for Boolean Circuits (PM, MT, HV), pp. 64–78.
- TLCA-2007-Lindley
- Extensional Rewriting with Sums (SL), pp. 255–271.
- CADE-2005-Brown #reasoning #similarity #type system
- Reasoning in Extensional Type Theory with Equality (CEB), pp. 23–37.
- ICALP-2004-Rosu
- Extensional Theories and Rewriting (GR), pp. 1066–1079.
- POPL-2004-BalatCF #normalisation #partial evaluation #λ-calculus
- Extensional normalisation and type-directed partial evaluation for typed λ calculus with sums (VB, RDC, MPF), pp. 64–76.
- CSL-2003-Laird #named
- Bistability: An Extensional Characterization of Sequentiality (JL), pp. 372–383.
- CAiSE-2002-PontieriUZ #approach #data flow #integration
- An Approach for Synergically Carrying out Intensional and Extensional Integration of Data Sources Having Different Formats (LP, DU, EZ), pp. 752–756.
- RTA-2002-SeveriV
- An Extensional Böhm Model (PS, FJdV), pp. 159–173.
- POPL-2001-Sangiorgi #logic
- Extensionality and Intensionality of the Ambient Logics (DS), pp. 4–13.
- CSL-2001-Bezem #higher-order #logic programming #source code
- An Improved Extensionality Criterion for Higher-Order Logic Programs (MB), pp. 203–216.
- LICS-2001-Pfenning #proving #type system
- Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory (FP), pp. 221–230.
- LICS-2001-StumpBDL #array
- A Decision Procedure for an Extensional Theory of Arrays (AS, CWB, DLD, JRL), pp. 29–37.
- PPDP-2000-Rocca #semantics
- Operational semantics and extensionality (SRDR), pp. 24–31.
- FLOPS-1999-Danvy #λ-calculus
- An Extensional Characterization of λ-Lifting and λ-Dropping (OD), pp. 241–250.
- CADE-1999-Benzmuller #higher-order
- Extensional Higher-Order Paramodulation and RUE-Resolution (CB), pp. 399–413.
- ICLP-1999-Bezem #logic programming #source code
- Extensionality of Simply Typed Logic Programs (MB), pp. 395–410.
- LICS-1999-Altenkirch #similarity #type system
- Extensional Equality in Intensional Type Theory (TA), pp. 412–420.
- CIKM-1998-SchmittT #approach #incremental #integration
- An Incremental Approach to Schema Integration by Refining Extensional Relationships (IS, CT), pp. 322–330.
- CADE-1998-BenzmullerK #higher-order
- Extensional Higher-Order Resolution (CB, MK), pp. 56–71.
- ICALP-1997-CosmoG #composition #higher-order #on the #λ-calculus
- On Modular Properties of Higher Order Extensional λ Calculi (RDC, NG), pp. 237–247.
- RTA-1996-Kesner #confluence #λ-calculus
- Confluence Properties of Extensional and Non-Extensional λ-Calculi with Explicit Substitutions (Extended Abstract) (DK), pp. 184–199.
- LICS-1995-Piperno #normalisation
- Normalization and Extensionality (Extended Abstract) (AP), pp. 300–310.
- TLCA-1995-CosmoP #morphism #polymorphism
- Expanding Extensional Polymorphism (RDC, AP), pp. 139–153.
- ICALP-1994-CosmoK #algebra #first-order #recursion #term rewriting #λ-calculus
- Combining First Order Algebraic Rewriting Systems, Recursion and Extensional λ Calculi (RDC, DK), pp. 462–472.
- 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.
- LICS-1994-PipernoR #type inference
- Type Inference and Extensionality (AP, SRDR), pp. 196–205.
- ICALP-1993-CosmoK #confluence #recursion #reduction #λ-calculus
- A Confluent Reduction for the Extensional Typed λ-Calculus with Pairs, Sums, Recursion and terminal Object (RDC, DK), pp. 645–656.
- ILPS-1993-DovierR #finite #set
- Embedding extensional finite sets in CLP (AD, GR), pp. 540–556.
- ICALP-1991-BucciarelliE
- Extensional Embedding of a Strongly Stable Model of PCF (AB, TE), pp. 35–46.
- LICS-1991-Stoughton #parallel
- Parallel PCF Has a Unique Extensional Model (AS), pp. 146–151.
- LICS-1990-FreydMRS
- Extensional PERs (PJF, PM, GR, DSS), pp. 346–354.
- SIGIR-1988-LaineLV #information management #logic
- French Textual Information Systems: The Contribution of Extensional and Intensional Logics (SL, OL, IV), pp. 507–518.