Joe B. Wells

发表

Type error slicing in implicitly typed higher-order languages

Christian Haack, Joe B. Wells, 2004, Sci. Comput. Program..

Expressiveness of Generic Process Shape Types pdf

Joe B. Wells, Jan Jakubuv, 2010, TGC.

System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types

Assaf J. Kfoury, Joe B. Wells, Sébastien Carlier, 2004, ESOP.

Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types

Tom Hirschowitz, Xavier Leroy, Joe B. Wells, 2004, ESOP.

Principality and type inference for intersection types using expansion variables

Assaf J. Kfoury, Joe B. Wells, A. Kfoury, 2004, Theor. Comput. Sci..

Calculi of Generalized beta-Reduction and Explicit Substitutions: The Type-Free and Simply Typed Versions

Fairouz Kamareddine, Alejandro Ríos, Joe B. Wells, 1998, J. Funct. Log. Program..

Computerizing Mathematical Text with MathLang

Fairouz Kamareddine, Joe B. Wells, Fairouz Kamareddine, 2008, LSFA.

Cycle therapy: a prescription for fold and unfold on regular trees

Joe B. Wells, Franklyn A. Turbak, 2001, PPDP '01.

A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables

Fairouz Kamareddine, Vincent Rahli, Joe B. Wells, 2008, ICTAC.

Skalpel: A Type Error Slicer for Standard ML

Fairouz Kamareddine, Vincent Rahli, Joe B. Wells, 2014, LSFA.

Diagrams for Meaning Preservation

Fairouz Kamareddine, Joe B. Wells, Detlef Plump, 2003, RTA.

Restoring Natural Language as a Computerised Mathematics Input Method

Fairouz Kamareddine, Joe B. Wells, Manuel Maarek, 2007, Calculemus/MKM.

Bridging Curry and Church's typing style

Fairouz Kamareddine, Joe B. Wells, Jonathan P. Seldin, 2016, J. Appl. Log..

Implementing Compositional Analysis Using Intersection Types With Expansion Variables

Assaf J. Kfoury, Geoffrey Washburn, Joe B. Wells, 2002, Electron. Notes Theor. Comput. Sci..

Relating typability and expressiveness in finite-rank intersection type systems (extended abstract)

Harry G. Mairson, Assaf J. Kfoury, Joe B. Wells, 1999, ICFP '99.

PolyA: True Type Polymorphism for Mobile Ambients

Torben Amtoft, Joe B. Wells, Henning Makholm, 2004, IFIP TCS.

Strongly typed flow-directed representation transformations (extended abstract)

Joe B. Wells, Franklyn A. Turbak, Robert Muller, 1997, ICFP '97.

Functioning without closure: type-safe customized function representations for standard ML

Joe B. Wells, Franklyn A. Turbak, Robert Muller, 2001, ICFP '01.

Expansion for Universal Quantifiers pdf

Joe B. Wells, Sergueï Lenglet, 2012, ESOP.

MathLang: Experience-driven Development of a New Mathematical Language

Fairouz Kamareddine, Joe B. Wells, Manuel Maarek, 2004, MKM Symposium.

Expansion: the Crucial Mechanism for Type Inference with Intersection Types: Survey and Explanation 1 Background and Motivation

Joe B. Wells, Sébastien Carlier, S. Carlier, 2022 .

Principality and decidable type inference for finite-rank intersection types

Assaf J. Kfoury, Joe B. Wells, A. Kfoury, 1999, POPL '99.

Narrative Structure of Mathematical Texts

Fairouz Kamareddine, Joe B. Wells, Manuel Maarek, 2007, Calculemus/MKM.

What Does This Notation Mean Anyway? pdf

Fairouz Kamareddine, David Feller, Joe B. Wells, 2018, ArXiv.

The Algebra of Expansion

Joe B. Wells, Sébastien Carlier, S. Carlier, 2012, Fundam. Informaticae.

Reducibility Proofs in the λ-Calculus

Fairouz Kamareddine, Vincent Rahli, Joe B. Wells, 2012, Fundam. Informaticae.

Cut rules and explicit substitutions

Joe B. Wells, René Vestergaard, René Vestergaard, 2001, Mathematical Structures in Computer Science.

Type inference with expansion variables and intersection types in system E and an exact correspondence with β-reduction

Joe B. Wells, Sébastien Carlier, 2004, PPDP '04.

Fully Automatic Adaptation of Software Components Based on Semantic Specifications

Alley Stoughton, Christian Haack, Joe B. Wells, 2002, AMAST.

BNF-Style Notation as It Is Actually Used

Fairouz Kamareddine, Joe B. Wells, Dee Quinlan, 2019, CICM.

Typability and Type Checking in System F are Equivalent and Undecidable

Joe B. Wells, J. Wells, 1999, Ann. Pure Appl. Log..

A Typed Intermediate Language for Flow-Directed Compilation

Joe B. Wells, Franklyn A. Turbak, Robert Muller, 1997, TAPSOFT.

MathLang Translation to Isabelle Syntax

Fairouz Kamareddine, Joe B. Wells, Robert Lamar, 2009, Calculemus/MKM.

Equational Reasoning for Linking with First-Class Primitive Modules

Joe B. Wells, René Vestergaard, René Vestergaard, 2000, ESOP.

Proof-Carrying Plans

Ronald P. A. Petrick, Ekaterina Komendantskaya, Joe B. Wells, 2018, PADL.

The Essence of Principal Typings

Joe B. Wells, J. Wells, 2002, ICALP.

A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus

Assaf J. Kfoury, Joe B. Wells, A. Kfoury, 1994, LFP '94.

Flexible Encoding of Mathematics on the Computer

Fairouz Kamareddine, Joe B. Wells, Manuel Maarek, 2004, MKM.

Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis

Joe B. Wells, Boris Yakobowski, 2004, LOPSTR.

Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close

Joe B. Wells, Henning Makholm, 2005, ESOP.

Introduction: Workshop on Intersection Types and Related Systems (ITRS'00)

Joe B. Wells, 2000, ICALP Satellite Workshops.

Type error slicing in implicitly typed higher-order languages

Christian Haack, Joe B. Wells, C. Haack, 2003, Sci. Comput. Program..

Automath Type Inclusion in Barendregt's Cube

Fairouz Kamareddine, Joe B. Wells, Daniel Lima Ventura, 2015, CSR.

On Realisability Semantics for Intersection Types with Expansion Variables

Fairouz Kamareddine, Vincent Rahli, Joe B. Wells, 2012, Fundam. Informaticae.

Branching Types

Christian Haack, Joe B. Wells, 2002, ESOP.

New notions of reduction and non-semantic proofs of strong /spl beta/-normalization in typed /spl lambda/-calculi

Assaf J. Kfoury, Joe B. Wells, J. B. Wells, 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

Skalpel: A constraint-based type error slicer for Standard ML

Fairouz Kamareddine, Vincent Rahli, Joe B. Wells, 2017, J. Symb. Comput..

Computerising Mathematical Text

Hendrik Pieter Barendregt, Fairouz Kamareddine, Joe B. Wells, 2014, Computational Logic.

Program Representation Size in an Intermediate Language with Intersection and Union Types

Jeffrey Considine, Joe B. Wells, Franklyn A. Turbak, 2000, Types in Compilation.

A calculus with polymorphic and polyvariant flow types

Joe B. Wells, Franklyn A. Turbak, Robert Muller, 2002, J. Funct. Program..

Toward an Object-Oriented Structure for Mathematical Text

Fairouz Kamareddine, Joe B. Wells, Manuel Maarek, 2005, MKM.

XML Diff and Patch Tool

Joe B. Wells, Kyriakos Komvoteas, J. Wells, 2003 .

Type inference, principal typings, and let-polymorphism for first-class mixin modules

Joe B. Wells, Henning Makholm, 2005, ICFP '05.

Generating Custom Set Theories with Non-set Structured Objects

Fairouz Kamareddine, Joe B. Wells, Ciarán Dunne, 2021, CICM.

Addendum to ``New Notions of Reduction and Non-Semantic Proofs of Beta Strong Normalization in Typed Lambda Calculi''''

Assaf J. Kfoury, Joe B. Wells, J. B. Wells, 1995 .

Type Inference and Principal Typings for Symmetric Record Concatenation and Mixin Modules

Joe B. Wells, Henning Makholm, 2005 .

Instant Polymorphic Types for Mobile Process Calculi: Just add Reduction Rules and Close

Joe B. Wells, Henning Makholm, 2005 .

Inferring Intersection Typings that are Equivalent to Call-by-Name and Call-by-Value Evaluations

Assaf J. Kfoury, Joe B. Wells, Sébastien Carlier, 2005 .

On the implementation of recursion in call-by-value functional languages

Tom Hirschowitz, Joe B. Wells, Xavier Leroy, 2003 .

Type Inference for PolyA

Joe B. Wells, Henning Makholm, 2004 .

Type inference for system f with and without the eta rule

Assaf J. Kfoury, Joe B. Wells, J. B. Wells, 1996 .

A reduction semantics for call-by-value mixin modules

Tom Hirschowitz, Joe B. Wells, Xavier Leroy, 2002 .