Mitchell Wand

According to our database1, Mitchell Wand
  • authored at least 103 papers between 1972 and 2017.
  • has a "Dijkstra number"2 of three.

Awards

ACM Fellow

ACM Fellow 2007, "For contributions to type theory and program analysis.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Inferring scope through syntactic sugar.
PACMPL, 2017

2016
Romeo: A system for more flexible binding-safe programming.
J. Funct. Program., 2016

2014
Romeo: a system for more flexible binding-safe programming.
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

2011
A Resource Analysis of the π-calculus.
Electr. Notes Theor. Comput. Sci., 2011

A resource analysis of the pi-calculus
CoRR, 2011

Parsing Reflective Grammars
CoRR, 2011

A separation logic for refining concurrent objects.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Parsing reflective grammars.
Proceedings of the Language Descriptions, Tools and Applications, 2011

2010
Bottom-up beta-reduction: Uplinks and lambda-DAGs.
Fundam. Inform., 2010

2009
The Higher-Order Aggregate Update Problem.
Proceedings of the Verification, 2009

2008
Programming languages: fundamental concepts for expanding and disciplining the mind.
SIGPLAN Notices, 2008

SIGPLAN programming language curriculum workshop: Discussion Summaries and recommendations.
SIGPLAN Notices, 2008

A Theory of Hygienic Macros.
Proceedings of the Programming Languages and Systems, 2008

A Compositional Trace Semantics for Orc.
Proceedings of the Coordination Models and Languages, 10th International Conference, 2008

Essentials of programming languages (3. ed.).
MIT Press, ISBN: 978-0-262-06279-4, 2008

2007
On the correctness of the Krivine machine.
Higher-Order and Symbolic Computation, 2007

2006
Small bisimulations for reasoning about higher-order imperative programs.
Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2006

Bisimulations for Untyped Imperative Objects.
Proceedings of the Programming Languages and Systems, 2006

2005
Selectors Make Set-Based Analysis Too Hard.
Higher-Order and Symbolic Computation, 2005

Bottom-Up beta-Reduction: Uplinks and lambda-DAGs.
Proceedings of the Programming Languages and Systems, 2005

2004
A semantics for advice and dynamic join points in aspect-oriented programming.
ACM Trans. Program. Lang. Syst., 2004

Relating models of backtracking.
Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, 2004

2003
Understanding aspects: extended abstract.
SIGPLAN Notices, 2003

CPS transformation of flow information.
J. Funct. Program., 2003

Understanding aspects: extended abstract.
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

2002
A Modular, Extensible Proof Method for Small-Step Flow Analyses.
Proceedings of the Programming Languages and Systems, 2002

2001
Set constraints for destructive array update optimization.
J. Funct. Program., 2001

A Semantics for Advice and Dynamic Join Points in Aspect-Oriented Programming.
Proceedings of the Semantics, 2001

Essentials of programming languages (2. ed.).
MIT Press, ISBN: 978-0-262-06217-6, 2001

2000
Optimizing memory usage in higher-order programming languages: theoretical and experimental studies.
ACM SIGSOFT Software Engineering Notes, 2000

Analysis-based program transformations.
ACM SIGSOFT Software Engineering Notes, 2000

1999
Continuation-Based Multiprocessing.
Higher-Order and Symbolic Computation, 1999

Continuation-Based Multiprocessing Revisited.
Higher-Order and Symbolic Computation, 1999

Constraint Systems for Useless Variable Elimination.
Proceedings of the POPL '99, 1999

A Language for Specifying Recursive Traversals of Object Structures.
Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 1999

Trampolined Style.
Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999

1998
The Theory of Fexprs is Trivial.
Lisp and Symbolic Computation, 1998

Revised Report on the Algorithmic Language Scheme.
Higher-Order and Symbolic Computation, 1998

Set Constraints for Destructive Array Update Optimization.
Proceedings of the 1998 International Conference on Computer Languages, 1998

1997
Lightweight Closure Conversion.
ACM Trans. Program. Lang. Syst., 1997

Type Inference with Non-Structural Subtyping.
Formal Asp. Comput., 1997

Denotational Semantics Using an Operationally-Based Term Model.
Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

1996
Modeling Subobject-based Inheritance.
Proceedings of the ECOOP'96, 1996

Compiler Correctness for Concurrent Languages.
Proceedings of the Coordination Languages and Models, First International Conference, 1996

Untyped Lambda-Calculus with Input-Output.
Proceedings of the Trees in Algebra and Programming, 1996

1995
Strong Normalization with Non-Structural Subtyping.
Mathematical Structures in Computer Science, 1995

The VLISP Verified PreScheme Compiler.
Lisp and Symbolic Computation, 1995

VLISP: A Verified Implementation of Scheme.
Lisp and Symbolic Computation, 1995

Compiler Correctness for Parallel Languages.
Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

1994
Conditional Lambda-Theories and the Verification of Static Properties of Programs
Inf. Comput., September, 1994

Selective Thunkification.
SAS, 1994

Selective and Lightweight Closure Conversion.
Proceedings of the Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1994

1993
Specifying the Correctness of Binding-Time Analysis.
J. Funct. Program., 1993

Type Reconstruction with Recursive Types and Atomic Subtyping.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Specifying the Correctness of Binding-Time Analysis.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

1992
Proving the Correctness of Storage Representations.
LISP and Functional Programming, 1992

Type Inference for Partial Types is Decidable.
Proceedings of the ESOP '92, 1992

Essentials of programming languages.
MIT Press, ISBN: 978-0-262-06145-2, 1992

1991
Type Inference for Record Concatenation and Multiple Inheritance
Inf. Comput., July, 1991

Correctness of Static Flow Analysis in Continuation Semantics.
Sci. Comput. Program., 1991

Correctness of Procedure Representations in Higher-Order Assembly Language.
Proceedings of the Mathematical Foundations of Programming Semantics, 1991

Automatic Dimensional Inference.
Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

1990
A Short Proof of the Lexical Addressing Algorithm.
Inf. Process. Lett., 1990

Conditional Lambda-Theories and the Verification of Static Properties of Programs
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1989
Incorporating Static Analysis in a Combinator-Based Compiler
Inf. Comput., August, 1989

Type Inference for Record Concatenation and Multiple Inheritance
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

On the Complexity of Type Inference with Coercion.
Proceedings of the fourth international conference on Functional programming languages and computer architecture, 1989

1988
The Mystery of the Tower Revealed: A Nonreflective Description of the Reflective Tower.
Lisp and Symbolic Computation, 1988

Correct Flow Analysis in Continuation Semantics.
Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988

Corrigendum: Complete Type Inference for Simple Objects
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

Abstract Continuations: A Mathematical Semantics for Handling Full Jumps.
LISP and Functional Programming, 1988

1987
Linear Future Semantics and Its Implementation.
Sci. Comput. Program., 1987

Macro-by-Example: Deriving Syntactic Transformations from their Specifications.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

Complete Type Inference for Simple Objects
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1986
Obtaining Coroutines with Continuations.
Comput. Lang., 1986

Finding the Source of Type Errors.
Proceedings of the Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, 1986

The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower.
LISP and Functional Programming, 1986

1985
Embedding Type Structure in Semantics.
Proceedings of the Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 1985

From interpreter to compiler: a representational derivation.
Proceedings of the Programs as Data Objects, 1985

Continuation Semantics in Typed Lambda-Calculi (Summary).
Proceedings of the Logics of Programs, 1985

1984
A semantic prototyping system.
Proceedings of the 1984 SIGPLAN Symposium on Compiler Construction, 1984

A Types-as-Sets Semantics for Milner-Style Polymorphism.
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

Continuations and Coroutines.
LISP and Functional Programming, 1984

Reification: Reflection without Metaphysics.
LISP and Functional Programming, 1984

1983
Loops in Combinator-Based Compilers
Information and Control, 1983

Loops in Combinator-Based Compilers.
Proceedings of the Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, 1983

1982
Deriving Target Code as a Representation of Continuation Semantics.
ACM Trans. Program. Lang. Syst., 1982

Specifications, Models, and Implementations of Data Abstractions.
Theor. Comput. Sci., 1982

Semantics-Directed Machine Architecture.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

1980
Continuation-Based Program Transformation Strategies.
J. ACM, 1980

First-Order Identities as a Defining Language.
Acta Inf., 1980

Continuation-Based Multiprocessing.
LISP Conference, 1980

1979
Fixed-Point Constructions in Order-Enriched Categories.
Theor. Comput. Sci., 1979

Final Algebra Semantics and Data Type Extensions.
J. Comput. Syst. Sci., 1979

1978
A New Incompleteness Result for Hoare's System.
J. ACM, 1978

Compiling Lambda-Expressions Using Continuations and Factorizations.
Comput. Lang., 1978

1977
A Characterization of Weakest Preconditions.
J. Comput. Syst. Sci., 1977

1976
A New Incompleteness Result for Hoare's System
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

Recursive programming through table look-up.
Proceedings of the SYMSAC 1976, 1976

1974
On the recursive specification of data types.
Proceedings of the Category Theory Applied to Computation and Control, 1974

An algebraic formulation of the Chomsky hierarchy.
Proceedings of the Category Theory Applied to Computation and Control, 1974

1973
An Unusual Application of Program-Proving
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

1972
A Concrete Approach to Abstract Recursion Definitions.
ICALP, 1972


  Loading...