John C. Mitchell

Affiliations:
  • Stanford University, Department of Computer Science


According to our database1, John C. Mitchell authored at least 215 papers between 1982 and 2022.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2008, "For contributions to the theory of programming languages.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
The Move Borrow Checker.
CoRR, 2022

Insights for post-pandemic pedagogy across one CS department.
CoRR, 2022

Feedback on Program Development Process for CS1 Students.
Proceedings of the SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education, 2022

Using NLP to Quantify Program Decomposition in CS1.
Proceedings of the L@S'22: Ninth ACM Conference on Learning @ Scale, New York City, NY, USA, June 1, 2022

Function Names: Quantifying the Relationship Between Identifiers and Their Functionality to Improve Them.
Proceedings of the L@S'22: Ninth ACM Conference on Learning @ Scale, New York City, NY, USA, June 1, 2022

2021
Assessing Function Names and Quantifying the Relationship Between Identifiers and Their Functionality to Improve Them.
Proceedings of the L@S'21: Eighth ACM Conference on Learning @ Scale, 2021

2020
Resources: A Safe Language Abstraction for Money.
CoRR, 2020

Teaching Online in 2020: Experiments, Empathy, Discovery.
Proceedings of the IEEE Learning With MOOCS, 2020

Reinforcement Learning for the Adaptive Scheduling of Educational Activities.
Proceedings of the CHI '20: CHI Conference on Human Factors in Computing Systems, 2020

Model Checking Bitcoin and other Proof-of-Work Consensus Protocols.
Proceedings of the IEEE International Conference on Blockchain, 2020

2019
Automated Analysis of Cryptographic Assumptions in Generic Group Models.
J. Cryptol., 2019

2018
Semantic Security Invariance under Variant Computational Assumptions.
IACR Cryptol. ePrint Arch., 2018

Data Oblivious Genome Variants Search on Intel SGX.
IACR Cryptol. ePrint Arch., 2018

OARS: exploring instructor analytics for online learning.
Proceedings of the Fifth Annual ACM Conference on Learning at Scale, 2018

2017
Flexible dynamic information flow control in the presence of exceptions.
J. Funct. Program., 2017

Hails: Protecting data privacy in untrusted web applications.
J. Comput. Secur., 2017

Privacy for Targeted Advertising.
IACR Cryptol. ePrint Arch., 2017

2016
Evaluating the privacy properties of telephone metadata.
Proc. Natl. Acad. Sci. USA, 2016

Data Representation and Compression Using Linear-Programming Approximations.
Proceedings of the 4th International Conference on Learning Representations, 2016

Target Fragmentation in Android Apps.
Proceedings of the 2016 IEEE Security and Privacy Workshops, 2016

Privacy-Preserving Shortest Path Computation.
Proceedings of the 23rd Annual Network and Distributed System Security Symposium, 2016

2015
IFC Inside: Retrofitting Languages with Dynamic Information Flow Control (Extended Version).
CoRR, 2015

A Symbolic Logic with Concrete Bounds for Cryptographic Protocols.
CoRR, 2015

Fast Algorithms for Learning with Long N-grams via Suffix Tree Based Matrix Multiplication.
Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, 2015

IFC Inside: Retrofitting Languages with Dynamic Information Flow Control.
Proceedings of the Principles of Security and Trust - 4th International Conference, 2015

2014
MOOCs on and off the Farm: MOOCs and technology to advance learning and learning research (Ubiquity symposium).
Ubiquity, 2014

Massively Open Online Courses, Current State and Perspectives (Dagstuhl Perspectives Workshop 14112).
Dagstuhl Reports, 2014

Massive Open Online Courses: Current State and Perspectives (Dagstuhl Perspectives Workshop 14112).
Dagstuhl Manifestos, 2014

The End is Nigh: Generic Solving of Text-based CAPTCHAs.
Proceedings of the 8th USENIX Workshop on Offensive Technologies, 2014

Data-Oblivious Data Structures.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Easy does it: more usable CAPTCHAs.
Proceedings of the CHI Conference on Human Factors in Computing Systems, 2014

An Efficient Algorithm for Large Scale Compressive Feature Learning.
Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, 2014

2013
Understanding the Challenges with Medical Data Segmentation for Privacy.
Proceedings of the 2013 USENIX Workshop on Health Information Technologies, 2013

Compressive Feature Learning.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Toward Principled Browser Security.
Proceedings of the 14th Workshop on Hot Topics in Operating Systems, 2013

Oblivious Program Execution and Path-Sensitive Non-interference.
Proceedings of the 2013 IEEE 26th Computer Security Foundations Symposium, 2013

2012
A Learning-Based Approach to Reactive Security.
IEEE Trans. Dependable Secur. Comput., 2012

Privacy and Cybersecurity: The Next 100 Years.
Proc. IEEE, 2012

Information-flow control for programming on encrypted data.
IACR Cryptol. ePrint Arch., 2012

SessionJuggler: secure web login from an untrusted terminal using session hijacking.
Proceedings of the 21st World Wide Web Conference 2012, 2012

Third-Party Web Tracking: Policy and Technology.
Proceedings of the IEEE Symposium on Security and Privacy, 2012

Declarative privacy policy: finite models and attribute-based encryption.
Proceedings of the ACM International Health Informatics Symposium, 2012

Addressing covert termination and timing channels in concurrent information flow systems.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

2011
Security Modeling and Analysis.
IEEE Secur. Priv., 2011

A Domain-Specific Language for Computing on Encrypted Data.
IACR Cryptol. ePrint Arch., 2011

A Symbolic Logic with Exact Bounds for Cryptographic Protocols.
Proceedings of the Logic, Language, Information and Computation, 2011

Automated Analysis of Security-Critical JavaScript APIs.
Proceedings of the 32nd IEEE Symposium on Security and Privacy, 2011

The Failure of Noise-Based Non-continuous Audio Captchas.
Proceedings of the 32nd IEEE Symposium on Security and Privacy, 2011

Program Analysis for Web Security.
Proceedings of the Static Analysis - 18th International Symposium, 2011

Disjunction Category Labels.
Proceedings of the Information Security Technology for Applications, 2011

TBA : A Hybrid of Logic and Extensional Access Control Systems.
Proceedings of the Formal Aspects of Security and Trust - 8th International Workshop, 2011

Flexible dynamic information flow control in Haskell.
Proceedings of the 4th ACM SIGPLAN Symposium on Haskell, 2011

A Domain-Specific Language for Computing on Encrypted Data (Invited Talk).
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Reclaiming the Blogosphere, TalkBack: A Secure LinkBack Protocol for Weblogs.
Proceedings of the Computer Security - ESORICS 2011, 2011

Text-based CAPTCHA strengths and weaknesses.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

Protocol Composition Logic.
Proceedings of the Formal Models and Techniques for Analyzing Security Protocols, 2011

2010
A Security Evaluation of DNSSEC with NSEC3.
IACR Cryptol. ePrint Arch., 2010

Privacy Challenges in Patient-centric Health Information Systems.
Proceedings of the 1st USENIX Workshop on Health Security and Privacy, 2010

Webseclab Security Education Workbench.
Proceedings of the 3rd Workshop on Cyber Security Experimentation and Test, 2010

Homogeneity as an Advantage: It Takes a Community to Protect an Application.
Proceedings of the 2010 Workshop on Collaborative Methods for Security and Privacy, 2010

Object Capabilities and Isolation of Untrusted Web Applications.
Proceedings of the 31st IEEE Symposium on Security and Privacy, 2010

How Good Are Humans at Solving CAPTCHAs? A Large Scale Evaluation.
Proceedings of the 31st IEEE Symposium on Security and Privacy, 2010

State of the Art: Automated Black-Box Web Application Vulnerability Testing.
Proceedings of the 31st IEEE Symposium on Security and Privacy, 2010

Towards a Formal Foundation of Web Security.
Proceedings of the 23rd IEEE Computer Security Foundations Symposium, 2010

2009
An Automated Approach for Proving PCL Invariants.
Electron. Notes Theor. Comput. Sci., 2009

Securing frame communication in browsers.
Commun. ACM, 2009

A Formalization of HIPAA for a Medical Messaging System.
Proceedings of the Trust, 2009

Practical declarative network management.
Proceedings of the 1st ACM SIGCOMM 2009 Workshop on Research on Enterprise Networking, 2009

Isolating JavaScript with Filters, Rewriting, and Wrappers.
Proceedings of the Computer Security, 2009

09073 Abstracts Collection - Model-Based Design of Trustworthy Health Information Systems.
Proceedings of the Model-Based Design of Trustworthy Health Information Systems, 11.02., 2009

Using Strategy Objectives for Network Security Analysis.
Proceedings of the Information Security and Cryptology - 5th International Conference, 2009

TrackBack spam: abuse and prevention.
Proceedings of the first ACM Cloud Computing Security Workshop, 2009

2008
Characterizing Bots' Remote Control Behavior.
Proceedings of the Botnet Detection: Countering the Largest Security Threat, 2008

On the Relationships between Notions of Simulation-Based Security.
J. Cryptol., 2008

Towards Systematic Evaluation of the Evadability of Bot/Botnet Detection Methods.
Proceedings of the 2nd USENIX Workshop on Offensive Technologies, 2008

A Layered Architecture for Detecting Malicious Behaviors.
Proceedings of the Recent Advances in Intrusion Detection, 11th International Symposium, 2008

Robust defenses for cross-site request forgery.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

An Operational Semantics for JavaScript.
Proceedings of the Programming Languages and Systems, 6th Asian Symposium, 2008

Analysis of EAP-GPSK Authentication Protocol.
Proceedings of the Applied Cryptography and Network Security, 6th International Conference, 2008

2007
Inductive Proof Method for Computational Secrecy.
IACR Cryptol. ePrint Arch., 2007

Protocol Composition Logic (PCL).
Electron. Notes Theor. Comput. Sci., 2007

Transaction Generators: Root Kits for Web.
Proceedings of the 2nd USENIX Workshop on Hot Topics in Security, 2007

Formal Proofs of Cryptographic Security of Diffie-Hellman-Based Protocols.
Proceedings of the Trustworthy Global Computing, Third Symposium, 2007

Inductive Proofs of Computational Secrecy.
Proceedings of the Computer Security, 2007

Characterizing Bots' Remote Control Behavior.
Proceedings of the Detection of Intrusions and Malware, 2007

Privacy and Utility in Business Processes.
Proceedings of the 20th IEEE Computer Security Foundations Symposium, 2007

2006
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols.
Theor. Comput. Sci., 2006

Compositional analysis of contract-signing protocols.
Theor. Comput. Sci., 2006

Understanding SPKI/SDSI using first-order logic.
Int. J. Inf. Sec., 2006

Inductive Trace Properties for Computational Security.
IACR Cryptol. ePrint Arch., 2006

Key Exchange Protocols: Security Definition, Proof Method and Applications.
IACR Cryptol. ePrint Arch., 2006

Protecting browser state from web privacy attacks.
Proceedings of the 15th international conference on World Wide Web, 2006

Privacy and Contextual Integrity: Framework and Applications.
Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P 2006), 2006

Managing Digital Rights using Linear Logic.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Computationally Sound Compositional Logic for Key Exchange Protocols.
Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

Secrecy Analysis in Protocol Composition Logic.
Proceedings of the Advances in Computer Science, 2006

2005
Contract signing, optimism, and advantage.
J. Log. Algebraic Methods Program., 2005

A derivation system and compositional logic for security protocols.
J. Comput. Secur., 2005

Beyond proof-of-compliance: security analysis in trust management.
J. ACM, 2005

Games and the Impossibility of Realizable Ideal Functionality.
IACR Cryptol. ePrint Arch., 2005

Stronger Password Authentication Using Browser Extensions.
Proceedings of the 14th USENIX Security Symposium, Baltimore, MD, USA, July 31, 2005

Security analysis of network protocols: logical and computational methods.
Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005

Enterprise privacy promises and enforcement.
Proceedings of the POPL 2005 Workshop on Issues in the Theory of Security, 2005

Security Analysis and Improvements for IEEE 802.11i.
Proceedings of the Network and Distributed System Security Symposium, 2005

Probabilistic Polynomial-Time Semantics for a Protocol Security Logic.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

A modular correctness proof of IEEE 802.11i and TLS.
Proceedings of the 12th ACM Conference on Computer and Communications Security, 2005

2004
Multiset rewriting and the complexity of bounded security protocols.
J. Comput. Secur., 2004

Reconstructing Trust Management.
J. Comput. Secur., 2004

Analysis of the 802.11i 4-way handshake.
Proceedings of the 2004 ACM Workshop on Wireless Security, 2004

Conflict and combination in privacy policy languages.
Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, 2004

Client-Side Defense Against Web-Based Identity Theft.
Proceedings of the Network and Distributed System Security Symposium, 2004

A Distributed High Assurance Reference Monitor.
Proceedings of the Information Security, 7th International Conference, 2004

Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

Abstraction and Refinement in Protocol Derivation.
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

Securing Java RMI-Based Distributed Applications.
Proceedings of the 20th Annual Computer Security Applications Conference (ACSAC 2004), 2004

2003
Security by typing.
Int. J. Softw. Tools Technol. Transf., 2003

Distributed Credential Chain Discovery in Trust Management.
J. Comput. Secur., 2003

A Compositional Logic for Proving Security Properties of Protocols.
J. Comput. Secur., 2003

A Type System for the Java Bytecode Language and Verifier.
J. Autom. Reason., 2003

Specifying and Verifying Hardware for Tamper-Resistant Software.
Proceedings of the 2003 IEEE Symposium on Security and Privacy (S&P 2003), 2003

Beyond Proof-of-Compliance: Safety and Availability Analysis in Trust Management.
Proceedings of the 2003 IEEE Symposium on Security and Privacy (S&P 2003), 2003

DATALOG with Constraints: A Foundation for Trust Management Languages.
Proceedings of the Practical Aspects of Declarative Languages, 5th International Symposium, 2003

A Role-based Trust-management Framework.
Proceedings of the 3rd DARPA Information Survivability Conference and Exposition (DISCEX-III 2003), 2003

A Derivation System for Security Protocols and its Logical Formalization.
Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW-16 2003), 30 June, 2003

Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus.
Proceedings of the CONCUR 2003, 2003

Secure protocol composition.
Proceedings of the 2003 ACM workshop on Formal methods in security engineering, 2003

Relating cryptography and formal methods: a panel.
Proceedings of the 2003 ACM workshop on Formal methods in security engineering, 2003

Concepts in programming languages.
Cambridge University Press, ISBN: 978-0-521-78098-8, 2003

2002
Finite-state analysis of two contract signing protocols.
Theor. Comput. Sci., 2002

Design of a Role-Based Trust-Management Framework.
Proceedings of the 2002 IEEE Symposium on Security and Privacy, 2002

Multiset Rewriting and Security Protocol Analysis.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

Autonomous Nodes and Distributed Mechanisms.
Proceedings of the Software Security -- Theories and Systems, 2002

A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis.
Proceedings of the Software Security -- Theories and Systems, 2002

2001
A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Preliminary Report).
Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

Programming language methods in computer security.
Proceedings of the Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2001

Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis.
Proceedings of the Programming Languages and Systems, 2001

A Compositional Logic for Protocol Correctness.
Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001

A State-Transition Model of Trust Management and Access Control.
Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001

Distributed credential chain discovery in trust management: extended abstract.
Proceedings of the CCS 2001, 2001

2000
Analysis of a Fair Exchange Protocol.
Proceedings of the Network and Distributed System Security Symposium, 2000

Analysis of Abuse-Free Contract Signing.
Proceedings of the Financial Cryptography, 2000

Relating Strands and Multiset Rewriting for Security Protocol Analysis.
Proceedings of the 13th IEEE Computer Security Foundations Workshop, 2000

Architectural Support for Copy and Tamper Resistant Software.
Proceedings of the ASPLOS-IX Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems, 2000

1999
The type system for object initializatiion in the Jave bytecode language.
ACM Trans. Program. Lang. Syst., 1999

Optimization Complexity of Linear Logic Proof Games.
Theor. Comput. Sci., 1999

Parametricity and Variants of Girard's <i>J</i> Operator.
Inf. Process. Lett., 1999

A Core Calculus of Classes and Objects.
Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999

A Formal Framework for the Java Bytecode Language and Verifier.
Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 1999

Probabilistic Polynomial-Time Equivalence and Security Analysis.
Proceedings of the FM'99 - Formal Methods, 1999

A Meta-Notation for Protocol Analysis.
Proceedings of the 12th IEEE Computer Security Foundations Workshop, 1999

1998
On the Relationship Between Classes, Objects, and Data Abstraction.
Theory Pract. Object Syst., 1998

Finite-State Analysis of SSL 3.0.
Proceedings of the 7th USENIX Security Symposium, 1998

A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

A Probabilistic Poly-Time Framework for Protocol Analysis.
Proceedings of the CCS '98, 1998

Finite-State Analysis of Security Protocols.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1997
ML and Beyond.
ACM SIGPLAN Notices, 1997

The analysis of programming structure.
SIGACT News, 1997

A Type System For Object Initialization In the Java Bytecode Language.
Electron. Notes Theor. Comput. Sci., 1997

Automated analysis of cryptographic protocols using Mur-phi.
Proceedings of the 1997 IEEE Symposium on Security and Privacy, 1997

Adding Type Parameterization to the Java Language.
Proceedings of the 1997 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 1997

1996
Standard ML-NJ Weak Polymorphism and Imperative Constructs.
Inf. Comput., 1996

The Complexity of Local Proof Search in Linear Logic.
Electron. Notes Theor. Comput. Sci., 1996

Strategic Directions in Software Engineering and Programming Languages.
ACM Comput. Surv., 1996

Linear logic proof games and optimization.
Bull. Symb. Log., 1996

Effective Models of Polymorphism, Subtyping and Recursion (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Foundations for programming languages.
Foundation of computing series, MIT Press, ISBN: 978-0-262-13321-0, 1996

1995
The Development of Type Systems for Object-Oriented Languages.
Theory Pract. Object Syst., 1995

Lower Bounds on Type Inference with Subtypes.
Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995

A Delegation-based Object Calculus with Subtying.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994
A lambda Calculus of Objects and Method Specialization.
Nord. J. Comput., 1994

An Extension of System F with Subtyping
Inf. Comput., 1994

Notes on Typed Object-Oriented Programming.
Proceedings of the Theoretical Aspects of Computer Software, 1994

A Type System for Prototyping Languages.
Proceedings of the Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1994

Polymorphism and Subtyping in Interfaces.
Proceedings of the Workshop on Interface Definition Languages, 1994

1993
On the Type Structure of Standard ML.
ACM Trans. Program. Lang. Syst., 1993

On Abstraction and the Expressive Power of Programming Languages.
Sci. Comput. Program., 1993

Type Inference with Extended Pattern Matching and Subtypes.
Fundam. Informaticae, 1993

Standard ML-NJ weak polymorphism and imperative constructs
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

1992
Decision Problems for Propositional Linear Logic.
Ann. Pure Appl. Log., 1992

Algorithmic Aspects of Type Inference with Subtypes.
Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992

PER Models of Subtyping, Recursive Types and Higher-Order Polymorphism.
Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992

Operational aspects of linear lambda calculus
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

Notes on Sconing and Relators.
Proceedings of the Computer Science Logic, 6th Workshop, 1992

1991
Operations on Records.
Math. Struct. Comput. Sci., 1991

Type Inference With Simple Subtypes.
J. Funct. Program., 1991

Kripke-Style Models for Typed lambda Calculus.
Ann. Pure Appl. Log., 1991

An Extension of Standard ML Modules with Subtyping and Inheritance.
Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991

Connecting Formal Semantics to Constructive Intuitions.
Proceedings of the Constructivity in Computer Science, 1991

On the Equivalence of Data Representations.
Proceedings of the Artificial and Mathematical Theory of Computation, 1991

Unification and ML-Type Reconstruction.
Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

1990
The Semantics of Second-Order Lambda Calculus
Inf. Comput., March, 1990

Toward a Typed Foundation for Method Specialization and Inheritance.
Proceedings of the Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990

Higher-Order Modules and the Phase Distinction.
Proceedings of the Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990

Operational and Axiomatic Semantics of PCF.
Proceedings of the 1990 ACM Conference on LISP and Functional Programming, 1990

Type Systems for Programming Languages.
Proceedings of the Handbook of Theoretical Computer Science, 1990

1989
Polymorphic Unification and ML Typing.
Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

F-Bounded Polymorphism for Object-Oriented Programming.
Proceedings of the fourth international conference on Functional programming languages and computer architecture, 1989

1988
Abstract Types Have Existential Type.
ACM Trans. Program. Lang. Syst., 1988

Polymorphic Type Inference and Containment
Inf. Comput., 1988

The Essence of ML.
Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988

ML with Extended Pattern Matching and Subtypes.
Proceedings of the 1988 ACM Conference on LISP and Functional Programming, 1988

1987
Empty Types in Polymorphic Lambda Calculus.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

1986
Realisability Semantics for Error-Tolerant Logics.
Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986

Representation Independence and Data Abstraction.
Proceedings of the Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, 1986

A Type-Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions (Summary).
Proceedings of the 1986 ACM Conference on LISP and Functional Programming, 1986

1985
Second-Order Logical Relations (Extended Abstract).
Proceedings of the Logics of Programs, 1985

1984
Lambda calculus models of typed programming languages.
PhD thesis, 1984

On the Sequential Nature of Unification.
J. Log. Program., 1984

Coercion and Type Inference.
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

Semantic Models for Second-Order Lambda Calculus
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983
The Implication Problem for Functional and Inclusion Dependencies
Inf. Control., March, 1983

Termination Assertions for Recursive Programs: Completeness and Axiomatic Definability
Inf. Control., 1983

Inference Rules for Functional and Inclusion Dependencies.
Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

1982
Axiomatic Definability and Completeness for Recursive Programs.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982


  Loading...