25 papers:
- PADL-2015-Hanus #compilation #constraints
- CHR(Curry): Interpretation and Compilation of Constraint Handling Rules in Curry (MH), pp. 74–89.
- TLCA-2015-EscardoX #consistency #nondeterminism
- The Inconsistency of a Brouwerian Continuity Principle with the Curry-Howard Interpretation (MHE, CX), pp. 153–164.
- TLCA-2015-Santo #calculus #exclamation
- Curry-Howard for Sequent Calculus at Last! (JES), pp. 165–179.
- CSL-2013-AschieriBB #normalisation
- Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1 (FA, SB, GB), pp. 45–60.
- RTA-2013-FujitaS #decidability
- Decidable structures between Church-style and Curry-style (KeF, AS), pp. 190–205.
- ICALP-v2-2012-Dowek #independence
- A Theory Independent Curry-De Bruijn-Howard Correspondence (GD), pp. 13–15.
- PPDP-2012-BacciCFV #automation #first-order #source code #specification #synthesis
- Automatic synthesis of specifications for first order curry programs (GB, MC, MAF, AV), pp. 25–34.
- ICFP-2010-MazurakZ #concurrent #linear #logic #named
- Lolliproc: to concurrency from classical linear logic via curry-howard and control (KM, SZ), pp. 39–50.
- IJCAR-2010-Schack-NielsenS #linear #λ-calculus
- Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus (ASN, CS), pp. 1–14.
- PADL-2008-BrasselHM #database #programming
- High-Level Database Programming in Curry (BB, MH, MM), pp. 316–332.
- PPDP-2007-Hanus #declarative #javascript #programming #web
- Putting declarative programming into the web: translating curry to javascript (MH), pp. 155–166.
- RTA-2007-KutsiaLV #sequence #unification
- Sequence Unification Through Currying (TK, JL, MV), pp. 288–302.
- ICFP-2004-MarlowJ #higher-order #performance
- Making a fast curry: push/enter vs. eval/apply for higher-order languages (SM, SLPJ), pp. 4–15.
- CSL-2003-Miquel #normalisation #set
- A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory (AM), pp. 441–454.
- RTA-2002-LevyV #higher-order #problem #unification
- Currying Second-Order Unification Problems (JL, MV), pp. 326–339.
- FLOPS-2001-Lux #constraints #linear
- Adding Linear Constraints over Real Numbers to Curry (WL), pp. 185–200.
- PADL-2001-Hanus #web
- High-Level Server Side Web Scripting in Curry (MH), pp. 76–92.
- IFL-2000-HanusHN #declarative #multi #named #object-oriented
- ObjectCurry: An Object-Oriented Extension of the Declarative Multi-Paradigm Language Curry (MH, FH, PN), pp. 89–106.
- LICS-2000-Krivine #set
- The Curry-Howard Correspondence in Set Theory (JLK), pp. 307–308.
- FLOPS-1999-Ohori #automaton #logic #morphism
- The Logical Abstract Machine: A Curry-Howard Isomorphism for Machine Code (AO), pp. 300–318.
- TLCA-1999-Ohori #compilation #execution #morphism
- A Curry-Howard Isomorphism for Compilation and Program Execution (AO), pp. 280–294.
- POPL-1997-OngS #functional
- A Curry-Howard Foundation for Functional Computation with Control (CHLO, CAS), pp. 215–227.
- PLDI-1996-Ramsey #bytecode
- Relocating Machine Instructions by Currying (NR), pp. 226–236.
- LFP-1986-Ramsdell
- The CURRY Chip (JDR), pp. 122–131.
- POPL-1984-Wilhelm #attribute grammar
- Inverse Currying Transformation on Attribute Grammars (RW), pp. 140–147.