J. B. Wells - RankMe

50 papers A* 4A 8C 8Journal 14Unranked 15

Year	Rank	Type	Title / Venue / Authors
2022	C	`conf`	Isabelle/HOL/GST: A Formal Proof Environment for Generalized Set Theories. CICM Ciarán Dunne, J. B. Wells
2022	J	`jnl`	Isabelle/HOL/GST: A Formal Proof Environment for Generalized Set Theories. CoRR Ciarán Dunne, J. B. Wells
2021	C	`conf`	Generating Custom Set Theories with Non-set Structured Objects. CICM Ciarán Dunne, J. B. Wells, Fairouz Kamareddine
2020	C	`conf`	Adding an Abstraction Barrier to ZF Set Theory. CICM Ciarán Dunne, J. B. Wells, Fairouz Kamareddine
2020	J	`jnl`	Adding an Abstraction Barrier to ZF Set Theory. CoRR Ciarán Dunne, J. B. Wells, Fairouz Kamareddine
2016	J	`jnl`	Bridging Curry and Church's typing style. J. Appl. Log. Fairouz Kamareddine, Jonathan P. Seldin, J. B. Wells
2012	J	`jnl`	On Realisability Semantics for Intersection Types with Expansion Variables. Fundam. Informaticae Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells
2012	J	`jnl`	Reducibility Proofs in the λ-Calculus. Fundam. Informaticae Fairouz Kamareddine, Vincent Rahli, J. B. Wells
2012	J	`jnl`	The Algebra of Expansion. Fundam. Informaticae Sébastien Carlier, J. B. Wells
2010	J	`jnl`	Expressiveness of Generic Process Shape Types CoRR Jan Jakubuv, J. B. Wells
2010	—	`conf`	Expressiveness of Generic Process Shape Types. TGC Jan Jakubuv, J. B. Wells
2009	J	`jnl`	Compilation of extended recursion in call-by-value functional languages CoRR Tom Hirschowitz, Xavier Leroy, J. B. Wells
2009	J	`jnl`	Compilation of extended recursion in call-by-value functional languages. High. Order Symb. Comput. Tom Hirschowitz, Xavier Leroy, J. B. Wells
2009	—	`conf`	MathLang Translation to Isabelle Syntax. Calculemus/MKM Robert Lamar, Fairouz Kamareddine, J. B. Wells
2008	C	`conf`	A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables. ICTAC Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells
2007	—	`conf`	Computerizing Mathematical Text with MathLang. LSFA Fairouz Kamareddine, J. B. Wells
2007	—	`conf`	Narrative Structure of Mathematical Texts. Calculemus/MKM Fairouz Kamareddine, Manuel Maarek, Krzysztof Retel, J. B. Wells
2007	—	`conf`	Restoring Natural Language as a Computerised Mathematics Input Method. Calculemus/MKM Fairouz Kamareddine, Robert Lamar, Manuel Maarek, J. B. Wells
2005	A	`conf`	Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close. ESOP Henning Makholm, J. B. Wells
2005	—	`conf`	Toward an Object-Oriented Structure for Mathematical Text. MKM Fairouz Kamareddine, Manuel Maarek, J. B. Wells
2005	A	`conf`	Type inference, principal typings, and let-polymorphism for first-class mixin modules. ICFP Henning Makholm, J. B. Wells
2004	A	`conf`	Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types. ESOP Tom Hirschowitz, Xavier Leroy, J. B. Wells
2004	—	`conf`	Expansion: the Crucial Mechanism for Type Inference with Intersection Types: A Survey and Explanation. ITRS Sébastien Carlier, J. B. Wells
2004	—	`conf`	Flexible Encoding of Mathematics on the Computer. MKM Fairouz Kamareddine, Manuel Maarek, J. B. Wells
2004	C	`conf`	Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis. LOPSTR J. B. Wells, Boris Yakobowski
2004	—	`conf`	PolyA: True Type Polymorphism for Mobile Ambients. IFIP TCS Torben Amtoft, Henning Makholm, J. B. Wells
2004	J	`jnl`	Principality and type inference for intersection types using expansion variables. Theor. Comput. Sci. A. J. Kfoury, J. B. Wells
2004	A	`conf`	System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types. ESOP Sébastien Carlier, Jeff Polakow, J. B. Wells, A. J. Kfoury
2004	C	`conf`	Type inference with expansion variables and intersection types in system E and an exact correspondence with beta-reduction. PPDP Sébastien Carlier, J. B. Wells
2003	C	`conf`	Compilation of extended recursion in call-by-value functional languages. PPDP Tom Hirschowitz, Xavier Leroy, J. B. Wells
2003	—	`conf`	Diagrams for Meaning Preservation. RTA J. B. Wells, Detlef Plump, Fairouz Kamareddine
2003	—	`conf`	MathLang: Experience-driven Development of a New Mathematical Language. MKM Symposium Fairouz Kamareddine, Manuel Maarek, J. B. Wells
2002	J	`jnl`	A calculus with polymorphic and polyvariant flow types. J. Funct. Program. J. B. Wells, Allyn Dimock, Robert Muller, Franklyn A. Turbak
2002	A*	`conf`	The Essence of Principal Typings. ICALP J. B. Wells
2001	J	`jnl`	Cut rules and explicit substitutions. Math. Struct. Comput. Sci. René Vestergaard, J. B. Wells
2001	C	`conf`	Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees. PPDP Franklyn A. Turbak, J. B. Wells
2001	A	`conf`	Functioning without Closure: Type-Safe Customized Function Representations for Standard ML. ICFP Allyn Dimock, Ian Westmacott, Robert Muller, Franklyn A. Turbak, J. B. Wells
2000	A	`conf`	Equational Reasoning for Linking with First-Class Primitive Modules. ESOP J. B. Wells, René Vestergaard
2000	—	`ed.`	ICALP Workshops 2000, Proceedings of the Satelite Workshops of the 27th International Colloquium on Automata, Languages and Programming, Geneva, Switzerland, July 9-15, 2000 José D. P. Rolim, Andrei Z. Broder, Andrea Corradini, Roberto Gorrieri, Reiko Heckel, Juraj Hromkovic, Ugo Vaccaro, J. B. Wells
2000	—	`conf`	Introduction: Workshop on Intersection Types and Related Systems (ITRS'00). ICALP Satellite Workshops J. B. Wells
2000	—	`conf`	Program Representation Size in an Intermediate Language with Intersection and Union Types. Types in Compilation Allyn Dimock, Ian Westmacott, Robert Muller, Franklyn A. Turbak, J. B. Wells, Jeffrey Considine
1999	A*	`conf`	Principality and Decidable Type Inference for Finite-Rank Intersection Types. POPL A. J. Kfoury, J. B. Wells
1999	A	`conf`	Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract). ICFP Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, J. B. Wells
1999	J	`jnl`	Typability and Type Checking in System F are Equivalent and Undecidable. Ann. Pure Appl. Log. J. B. Wells
1998	J	`jnl`	Calculi of Generalized beta-Reduction and Explicit Substitutions: The Type-Free and Simply Typed Versions. J. Funct. Log. Program. Fairouz Kamareddine, Alejandro Ríos, J. B. Wells
1997	—	`conf`	A Typed Intermediate Language for Flow-Directed Compilation. TAPSOFT J. B. Wells, Allyn Dimock, Robert Muller, Franklyn A. Turbak
1997	A	`conf`	Strongly Typed Flow-Directed Representation Transformations. ICFP Allyn Dimock, Robert Muller, Franklyn A. Turbak, J. B. Wells
1995	A*	`conf`	New Notions of Reduction and Non-Semantic Proofs of beta-Strong Normalization in Typed lambda-Calculi LICS A. J. Kfoury, J. B. Wells
1994	—	`conf`	A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus. LISP and Functional Programming A. J. Kfoury, J. B. Wells
1994	A*	`conf`	Typability and Type-Checking in the Second-Order lambda-Calculus are Equivalent and Undecidable LICS J. B. Wells