default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoe B. Wells
Person information
- affiliation: Heriot-Watt University, Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c46]Luka Vrecar
, Joe B. Wells, Fairouz Kamareddine:
Towards Semantic Markup of Mathematical Documents via User Interaction. CICM 2024: 223-240- [c45]Fairouz Kamareddine, Joe B. Wells:
Intersection Types via Finite-Set Declarations. WoLLIC 2024: 80-92 - [i8]Fairouz Kamareddine, Joe B. Wells:
Intersection Types via Finite-Set Declarations. CoRR abs/2405.00440 (2024) - [i7]Luka Vrecar, Joe B. Wells, Fairouz Kamareddine:
Towards Semantic Markup of Mathematical Documents via User Interaction. CoRR abs/2408.04656 (2024) - 2022
- [c44]Ciarán Dunne, J. B. Wells:
Isabelle/HOL/GST: A Formal Proof Environment for Generalized Set Theories. CICM 2022: 38-55 - [i6]Ciarán Dunne, J. B. Wells:
Isabelle/HOL/GST: A Formal Proof Environment for Generalized Set Theories. CoRR abs/2207.12039 (2022) - 2021
- [c43]Ciarán Dunne, J. B. Wells, Fairouz Kamareddine:
Generating Custom Set Theories with Non-set Structured Objects. CICM 2021: 228-244 - 2020
- [c42]Ciarán Dunne, J. B. Wells, Fairouz Kamareddine:
Adding an Abstraction Barrier to ZF Set Theory. CICM 2020: 89-104 - [i5]Ciarán Dunne, J. B. Wells, Fairouz Kamareddine:
Adding an Abstraction Barrier to ZF Set Theory. CoRR abs/2005.13954 (2020)
2010 – 2019
- 2019
- [c41]Dee Quinlan, Joe B. Wells, Fairouz Kamareddine:
BNF-Style Notation as It Is Actually Used. CICM 2019: 187-204 - [c40]Christopher Schwaab, Ekaterina Komendantskaya, Alasdair Hill, Frantisek Farka, Ronald P. A. Petrick, Joe B. Wells, Kevin Hammond:
Proof-Carrying Plans. PADL 2019: 204-220 - 2018
- [i4]David Feller, Joe B. Wells, Fairouz Kamareddine, Sébastien Carlier:
What Does This Notation Mean Anyway? CoRR abs/1806.08771 (2018) - 2017
- [j12]Vincent Rahli, Joe B. Wells, John Pirie, Fairouz Kamareddine:
Skalpel: A constraint-based type error slicer for Standard ML. J. Symb. Comput. 80: 164-208 (2017) - 2016
- [j11]Fairouz Kamareddine, Jonathan P. Seldin, J. B. Wells:
Bridging Curry and Church's typing style. J. Appl. Log. 18: 42-70 (2016) - 2015
- [c39]Fairouz Kamareddine, Joe B. Wells, Daniel Lima Ventura:
Automath Type Inclusion in Barendregt's Cube. CSR 2015: 262-282 - 2014
- [c38]Vincent Rahli, Joe B. Wells, John Pirie, Fairouz Kamareddine:
Skalpel: A Type Error Slicer for Standard ML. LSFA 2014: 197-213 - [r1]Fairouz Kamareddine, Joe B. Wells, Christoph Zengler, Henk Barendregt:
Computerising Mathematical Text. Computational Logic 2014: 343-396 - 2012
- [j10]Sébastien Carlier, J. B. Wells:
The Algebra of Expansion. Fundam. Informaticae 121(1-4): 43-82 (2012) - [j9]Fairouz Kamareddine, Vincent Rahli, J. B. Wells:
Reducibility Proofs in the λ-Calculus. Fundam. Informaticae 121(1-4): 121-152 (2012) - [j8]Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells:
On Realisability Semantics for Intersection Types with Expansion Variables. Fundam. Informaticae 121(1-4): 153-184 (2012) - [c37]Sergueï Lenglet, Joe B. Wells:
Expansion for Universal Quantifiers. ESOP 2012: 456-475 - [i3]Sergueï Lenglet, Joe B. Wells:
Expansion for Universal Quantifiers. CoRR abs/1201.1101 (2012) - 2010
- [c36]Jan Jakubuv, J. B. Wells:
Expressiveness of Generic Process Shape Types. TGC 2010: 103-119 - [e2]Elaine Pimentel, Betti Venneri, Joe B. Wells:
Proceedings Fifth Workshop on Intersection Types and Related Systems, ITRS 2010, Edinburgh, U.K., 9th July 2010. EPTCS 45, 2010 [contents] - [i2]Jan Jakubuv, J. B. Wells:
Expressiveness of Generic Process Shape Types. CoRR abs/1003.6096 (2010)
2000 – 2009
- 2009
- [j7]Tom Hirschowitz, Xavier Leroy, J. B. Wells:
Compilation of extended recursion in call-by-value functional languages. High. Order Symb. Comput. 22(1): 3-66 (2009) - [c35]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
- [c34]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
- [c33]Fairouz Kamareddine, Robert Lamar, Manuel Maarek, J. B. Wells:
Restoring Natural Language as a Computerised Mathematics Input Method. Calculemus/MKM 2007: 280-295 - [c32]Fairouz Kamareddine, Manuel Maarek, Krzysztof Retel, J. B. Wells:
Narrative Structure of Mathematical Texts. Calculemus/MKM 2007: 296-312 - [c31]Fairouz Kamareddine, J. B. Wells:
Computerizing Mathematical Text with MathLang. LSFA 2007: 5-30 - 2005
- [c30]Henning Makholm, J. B. Wells:
Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close. ESOP 2005: 389-407 - [c29]Henning Makholm, J. B. Wells:
Type inference, principal typings, and let-polymorphism for first-class mixin modules. ICFP 2005: 156-167 - [c28]Fairouz Kamareddine, Manuel Maarek, J. B. Wells:
Toward an Object-Oriented Structure for Mathematical Text. MKM 2005: 217-233 - 2004
- [j6]Christian Haack, Joe B. Wells:
Type error slicing in implicitly typed higher-order languages. Sci. Comput. Program. 50(1-3): 189-224 (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) - [c27]Tom Hirschowitz, Xavier Leroy, J. B. Wells:
Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types. ESOP 2004: 64-78 - [c26]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 - [c25]Torben Amtoft, Henning Makholm, J. B. Wells:
PolyA: True Type Polymorphism for Mobile Ambients. IFIP TCS 2004: 591-604 - [c24]J. B. Wells, Boris Yakobowski:
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis. LOPSTR 2004: 262-277 - [c23]Fairouz Kamareddine, Manuel Maarek, J. B. Wells:
Flexible Encoding of Mathematics on the Computer. MKM 2004: 160-174 - [c22]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 - [c21]Sébastien Carlier, J. B. Wells:
Expansion: the Crucial Mechanism for Type Inference with Intersection Types: A Survey and Explanation. ITRS 2004: 173-202 - 2003
- [c20]Christian Haack, Joe B. Wells:
Type Error Slicing in Implicitly Typed Higher-Order Languages. ESOP 2003: 284-301 - [c19]Tom Hirschowitz, Xavier Leroy, J. B. Wells:
Compilation of extended recursion in call-by-value functional languages. PPDP 2003: 160-171 - [c18]J. B. Wells, Detlef Plump, Fairouz Kamareddine:
Diagrams for Meaning Preservation. RTA 2003: 88-106 - [c17]Fairouz Kamareddine, Manuel Maarek, J. B. Wells:
MathLang: Experience-driven Development of a New Mathematical Language. MKM Symposium 2003: 138-160 - 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) - [c16]Christian Haack, Brian Howard, Allen Stoughton, Joe B. Wells:
Fully Automatic Adaptation of Software Components Based on Semantic Specifications. AMAST 2002: 83-98 - [c15]Joe B. Wells, Christian Haack:
Branching Types. ESOP 2002: 115-132 - [c14]J. B. Wells:
The Essence of Principal Typings. ICALP 2002: 913-925 - [c13]Assaf J. Kfoury, Geoffrey Washburn, Joe B. Wells:
Implementing Compositional Analysis Using Intersection Types With Expansion Variables. ITRS 2002: 124-148 - 2001
- [j3]René Vestergaard, J. B. Wells:
Cut rules and explicit substitutions. Math. Struct. Comput. Sci. 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 - [e1]José D. P. Rolim, Andrei Z. Broder, Andrea Corradini, Roberto Gorrieri, Reiko Heckel, Juraj Hromkovic, Ugo Vaccaro, J. B. Wells:
ICALP Workshops 2000, Proceedings of the Satelite Workshops of the 27th International Colloquium on Automata, Languages and Programming, Geneva, Switzerland, July 9-15, 2000. Carleton Scientific, Waterloo, Ontario, Canada 2000, ISBN 1-894145-07-0 [contents]
1990 – 1999
- 1999
- [j2]J. B. Wells:
Typability and Type Checking in System F are Equivalent and Undecidable. Ann. Pure Appl. Log. 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. J. Funct. Log. Program. 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
