| 2012 | ||
|---|---|---|
| j12 | ||
| j11 | Fairouz Kamareddine, Vincent Rahli, J. B. Wells: Reducibility Proofs in the λ-Calculus. Fundam. Inform. 121(1-4): 121-152 (2012) | |
| j10 | Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells: On Realisability Semantics for Intersection Types with Expansion Variables. Fundam. Inform. 121(1-4): 153-184 (2012) | |
| 2010 | ||
| c29 | ||
| i2 | ||
| 2009 | ||
| j9 | Tom Hirschowitz, Xavier Leroy, J. B. Wells: Compilation of extended recursion in call-by-value functional languages. Higher-Order and Symbolic Computation 22(1): 3-66 (2009) | |
| c28 | Robert Lamar, Fairouz Kamareddine, J. B. Wells: MathLang Translation to Isabelle Syntax. Calculemus/MKM 2009: 373-388 | |
| i1 | Tom Hirschowitz, Xavier Leroy, J. B. Wells: Compilation of extended recursion in call-by-value functional languages. CoRR abs/0902.1257 (2009) | |
| 2008 | ||
| j8 | Fairouz Kamareddine, J. B. Wells: Computerizing Mathematical Text with MathLang. Electr. Notes Theor. Comput. Sci. 205: 5-30 (2008) | |
| c27 | Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells: A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables. ICTAC 2008: 171-185 | |
| 2007 | ||
| c26 | Fairouz Kamareddine, Robert Lamar, Manuel Maarek, J. B. Wells: Restoring Natural Language as a Computerised Mathematics Input Method. Calculemus/MKM 2007: 280-295 | |
| c25 | Fairouz Kamareddine, Manuel Maarek, Krzysztof Retel, J. B. Wells: Narrative Structure of Mathematical Texts. Calculemus/MKM 2007: 296-312 | |
| 2005 | ||
| j7 | Sébastien Carlier, J. B. Wells: Expansion: the Crucial Mechanism for Type Inference with Intersection Types: A Survey and Explanation. Electr. Notes Theor. Comput. Sci. 136: 173-202 (2005) | |
| c24 | Henning Makholm, J. B. Wells: Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close. ESOP 2005: 389-407 | |
| c23 | Henning Makholm, J. B. Wells: Type inference, principal typings, and let-polymorphism for first-class mixin modules. ICFP 2005: 156-167 | |
| c22 | Fairouz Kamareddine, Manuel Maarek, J. B. Wells: Toward an Object-Oriented Structure for Mathematical Text. MKM 2005: 217-233 | |
| 2004 | ||
| j6 | Fairouz Kamareddine, Manuel Maarek, J. B. Wells: MathLang: Experience-driven Development of a New Mathematical Language. Electr. Notes Theor. Comput. Sci. 93: 138-160 (2004) | |
| j5 | A. J. Kfoury, J. B. Wells: Principality and type inference for intersection types using expansion variables. Theor. Comput. Sci. 311(1-3): 1-70 (2004) | |
| c21 | Tom Hirschowitz, Xavier Leroy, J. B. Wells: Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types. ESOP 2004: 64-78 | |
| c20 | Sébastien Carlier, Jeff Polakow, J. B. Wells, A. J. Kfoury: System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types. ESOP 2004: 294-309 | |
| c19 | Torben Amtoft, Henning Makholm, J. B. Wells: PolyA: True Type Polymorphism for Mobile Ambients. IFIP TCS 2004: 591604 | |
| c18 | J. B. Wells, Boris Yakobowski: Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis. LOPSTR 2004: 262-277 | |
| c17 | Fairouz Kamareddine, Manuel Maarek, J. B. Wells: Flexible Encoding of Mathematics on the Computer. MKM 2004: 160-174 | |
| c16 | Sébastien Carlier, J. B. Wells: Type inference with expansion variables and intersection types in system E and an exact correspondence with beta-reduction. PPDP 2004: 132-143 | |
| 2003 | ||
| c15 | Tom Hirschowitz, Xavier Leroy, J. B. Wells: Compilation of extended recursion in call-by-value functional languages. PPDP 2003: 160-171 | |
| c14 | ||
| 2002 | ||
| j4 | J. B. Wells, Allyn Dimock, Robert Muller, Franklyn A. Turbak: A calculus with polymorphic and polyvariant flow types. J. Funct. Program. 12(3): 183-227 (2002) | |
| c13 | ||
| 2001 | ||
| j3 | René Vestergaard, J. B. Wells: Cut rules and explicit substitutions. Mathematical Structures in Computer Science 11(1): 131-168 (2001) | |
| c12 | Allyn Dimock, Ian Westmacott, Robert Muller, Franklyn A. Turbak, J. B. Wells: Functioning without Closure: Type-Safe Customized Function Representations for Standard ML. ICFP 2001: 14-25 | |
| c11 | Franklyn A. Turbak, J. B. Wells: Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees. PPDP 2001: 137-149 | |
| 2000 | ||
| c10 | J. B. Wells, René Vestergaard: Equational Reasoning for Linking with First-Class Primitive Modules. ESOP 2000: 412-428 | |
| c9 | J. B. Wells: Introduction: Workshop on Intersection Types and Related Systems (ITRS'00). ICALP Satellite Workshops 2000: 263-266 | |
| c8 | Allyn Dimock, Ian Westmacott, Robert Muller, Franklyn A. Turbak, J. B. Wells, Jeffrey Considine: Program Representation Size in an Intermediate Language with Intersection and Union Types. Types in Compilation 2000: 27-52 | |
| 1999 | ||
| j2 | J. B. Wells: Typability and Type Checking in System F are Equivalent and Undecidable. Ann. Pure Appl. Logic 98(1-3): 111-156 (1999) | |
| c7 | Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, J. B. Wells: Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract). ICFP 1999: 90-101 | |
| c6 | A. J. Kfoury, J. B. Wells: Principality and Decidable Type Inference for Finite-Rank Intersection Types. POPL 1999: 161-174 | |
| 1998 | ||
| j1 | Fairouz Kamareddine, Alejandro Ríos, J. B. Wells: Calculi of Generalized beta-Reduction and Explicit Substitutions: The Type-Free and Simply Typed Versions. Journal of Functional and Logic Programming 1998(5) (1998) | |
| 1997 | ||
| c5 | Allyn Dimock, Robert Muller, Franklyn A. Turbak, J. B. Wells: Strongly Typed Flow-Directed Representation Transformations. ICFP 1997: 11-24 | |
| c4 | J. B. Wells, Allyn Dimock, Robert Muller, Franklyn A. Turbak: A Typed Intermediate Language for Flow-Directed Compilation. TAPSOFT 1997: 757-771 | |
| 1995 | ||
| c3 | A. J. Kfoury, J. B. Wells: New Notions of Reduction and Non-Semantic Proofs of beta-Strong Normalization in Typed lambda-Calculi. LICS 1995: 311-321 | |
| 1994 | ||
| c2 | A. J. Kfoury, J. B. Wells: A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus. LISP and Functional Programming 1994: 196-207 | |
| c1 | J. B. Wells: Typability and Type-Checking in the Second-Order lambda-Calculus are Equivalent and Undecidable. LICS 1994: 176-185 | |
Colors in the list of coauthors
Last update Tue May 21 16:44:54 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page