Mitchell Wand

Publication Activity (10 Years)

Years Active: 1972-2020
Publications (10 Years): 5

Top Venues

Proc. ACM Program. Lang.

J. Funct. Program.

CoRR

ICFP

Publications

William D. Clinger, Mitchell Wand
Hygienic macro technology. Proc. ACM Program. Lang. 4 (HOPL) (2020)
Mitchell Wand, Ryan Culpepper, Theophilos Giannakopoulos, Andrew Cobb
Contextual Equivalence for a Probabilistic Language with Continuous Random Variables and Recursion. CoRR (2018)
Mitchell Wand, Ryan Culpepper, Theophilos Giannakopoulos, Andrew Cobb
Contextual equivalence for a probabilistic language with continuous random variables and recursion. Proc. ACM Program. Lang. 2 (ICFP) (2018)
Justin Pombrio, Shriram Krishnamurthi, Mitchell Wand
Inferring scope through syntactic sugar. Proc. ACM Program. Lang. 1 (ICFP) (2017)
Paul Stansifer, Mitchell Wand
Romeo: A system for more flexible binding-safe programming. J. Funct. Program. 26 (2016)
Paul Stansifer, Mitchell Wand
Romeo: a system for more flexible binding-safe programming. ICFP (2014)
Paul Stansifer, Mitchell Wand
Parsing Reflective Grammars CoRR (2011)
Paul Stansifer, Mitchell Wand
Parsing reflective grammars. LDTA (2011)
Aaron Joseph Turon, Mitchell Wand
A Resource Analysis of the π-calculus. MFPS (2011)
Aaron Joseph Turon, Mitchell Wand
A separation logic for refining concurrent objects. POPL (2011)
Aaron Joseph Turon, Mitchell Wand
A resource analysis of the pi-calculus CoRR (2011)
Olin Shivers, Mitchell Wand
Bottom-up beta-reduction: Uplinks and lambda-DAGs. Fundam. Informaticae 103 (1-4) (2010)
Christos Dimoulas, Mitchell Wand
The Higher-Order Aggregate Update Problem. VMCAI (2009)
Eric Allen, Mark W. Bailey, Rastislav Bodík, Kim B. Bruce, Kathleen Fisher, Stephen N. Freund, Robert Harper, Chandra Krintz, Shriram Krishnamurthi, James R. Larus, Doug Lea, Gary T. Leavens, Lori L. Pollock, Stuart Reges, Martin C. Rinard, Mark A. Sheldon, Franklyn A. Turbak, Mitchell Wand
SIGPLAN programming language curriculum workshop: Discussion Summaries and recommendations. ACM SIGPLAN Notices 43 (11) (2008)
David Herman, Mitchell Wand
A Theory of Hygienic Macros. ESOP (2008)
Mitchell Wand, Daniel P. Friedman
Programming languages: fundamental concepts for expanding and disciplining the mind. ACM SIGPLAN Notices 43 (11) (2008)
Dimitrios Vardoulakis, Mitchell Wand
A Compositional Trace Semantics for Orc. COORDINATION (2008)
Mitchell Wand
On the correctness of the Krivine machine. High. Order Symb. Comput. 20 (3) (2007)
Vasileios Koutavas, Mitchell Wand
Small bisimulations for reasoning about higher-order imperative programs. POPL (2006)
Vasileios Koutavas, Mitchell Wand
Bisimulations for Untyped Imperative Objects. ESOP (2006)
Olin Shivers, Mitchell Wand
Bottom-Up beta-Reduction: Uplinks and lambda-DAGs. ESOP (2005)
Philippe Meunier, Robert Bruce Findler, Paul Steckler, Mitchell Wand
Selectors Make Set-Based Analysis Too Hard. High. Order Symb. Comput. 18 (3-4) (2005)
Mitchell Wand, Dale Vaillancourt
Relating models of backtracking. ICFP (2004)
Mitchell Wand, Gregor Kiczales, Christopher Dutchyn
A semantics for advice and dynamic join points in aspect-oriented programming. ACM Trans. Program. Lang. Syst. 26 (5) (2004)
Jens Palsberg, Mitchell Wand
CPS transformation of flow information. J. Funct. Program. 13 (5) (2003)
Mitchell Wand
Understanding aspects: extended abstract. ICFP (2003)
Mitchell Wand
Understanding aspects: extended abstract. SIGPLAN Notices (2003)
Mitchell Wand, Galen B. Williamson
A Modular, Extensible Proof Method for Small-Step Flow Analyses. ESOP (2002)
Mitchell Wand, William D. Clinger
Set constraints for destructive array update optimization. J. Funct. Program. 11 (3) (2001)
Mitchell Wand
A Semantics for Advice and Dynamic Join Points in Aspect-Oriented Programming. SAIG (2001)
Mitchell Wand, William D. Clinger
Optimizing memory usage in higher-order programming languages: theoretical and experimental studies. ACM SIGSOFT Softw. Eng. Notes 25 (1) (2000)
Mitchell Wand
Analysis-based program transformations. ACM SIGSOFT Softw. Eng. Notes 25 (1) (2000)
Mitchell Wand
Continuation-Based Multiprocessing. High. Order Symb. Comput. 12 (3) (1999)
Mitchell Wand, Igor Siveroni
Constraint Systems for Useless Variable Elimination. POPL (1999)
Johan Ovlinger, Mitchell Wand
A Language for Specifying Recursive Traversals of Object Structures. OOPSLA (1999)
Steven E. Ganz, Daniel P. Friedman, Mitchell Wand
Trampolined Style. ICFP (1999)
Mitchell Wand
Continuation-Based Multiprocessing Revisited. High. Order Symb. Comput. 12 (3) (1999)
Mitchell Wand, William D. Clinger
Set Constraints for Destructive Array Update Optimization. ICCL (1998)
Mitchell Wand
The Theory of Fexprs is Trivial. LISP Symb. Comput. 10 (3) (1998)
Harold Abelson, R. Kent Dybvig, Christopher T. Haynes, Guillermo Juan Rozas, N. I. Adams IV, Daniel P. Friedman, Eugene E. Kohlbecker, Guy L. Steele Jr., David H. Bartley, Robert H. Halstead Jr., Don Oxley, Gerald J. Sussman, G. Brooks, Chris Hanson, Kent M. Pitman, Mitchell Wand
Revised Report on the Algorithmic Language Scheme. High. Order Symb. Comput. 11 (1) (1998)
Mitchell Wand, Gregory T. Sullivan
Denotational Semantics Using an Operationally-Based Term Model. POPL (1997)
Paul Steckler, Mitchell Wand
Lightweight Closure Conversion. ACM Trans. Program. Lang. Syst. 19 (1) (1997)
Jens Palsberg, Mitchell Wand, Patrick O'Keefe
Type Inference with Non-Structural Subtyping. Formal Aspects Comput. 9 (1) (1997)
Jerzy Tiuryn, Mitchell Wand
Untyped Lambda-Calculus with Input-Output. CAAP (1996)
David S. Gladstein, Mitchell Wand
Compiler Correctness for Concurrent Languages. COORDINATION (1996)
Jonathan G. Rossie Jr., Daniel P. Friedman, Mitchell Wand
Modeling Subobject-based Inheritance. ECOOP (1996)
Mitchell Wand
Compiler Correctness for Parallel Languages. FPCA (1995)
Joshua D. Guttman, John D. Ramsdell, Mitchell Wand
VLISP: A Verified Implementation of Scheme. LISP Symb. Comput. 8 (1-2) (1995)
Dino Oliva, John D. Ramsdell, Mitchell Wand
The VLISP Verified PreScheme Compiler. LISP Symb. Comput. 8 (1-2) (1995)
Mitchell Wand, Patrick O'Keefe, Jens Palsberg
Strong Normalization with Non-Structural Subtyping. Math. Struct. Comput. Sci. 5 (3) (1995)
Mitchell Wand, Paul Steckler
Selective and Lightweight Closure Conversion. POPL (1994)
Paul Steckler, Mitchell Wand
Selective Thunkification. SAS (1994)
Mitchell Wand, Zheng-Yu Wang
Conditional Lambda-Theories and the Verification of Static Properties of Programs Inf. Comput. 113 (2) (1994)
Jerzy Tiuryn, Mitchell Wand
Type Reconstruction with Recursive Types and Atomic Subtyping. TAPSOFT (1993)
Mitchell Wand
Specifying the Correctness of Binding-Time Analysis. J. Funct. Program. 3 (3) (1993)
Mitchell Wand
Specifying the Correctness of Binding-Time Analysis. POPL (1993)
Patrick O'Keefe, Mitchell Wand
Type Inference for Partial Types is Decidable. ESOP (1992)
Mitchell Wand, Dino Oliva
Proving the Correctness of Storage Representations. LISP and Functional Programming (1992)
Mitchell Wand, Patrick O'Keefe
Automatic Dimensional Inference. Computational Logic - Essays in Honor of Alan Robinson (1991)
Mitchell Wand
Type Inference for Record Concatenation and Multiple Inheritance Inf. Comput. 93 (1) (1991)
Mitchell Wand
Correctness of Procedure Representations in Higher-Order Assembly Language. MFPS (1991)
Margaret Montenyohl, Mitchell Wand
Correctness of Static Flow Analysis in Continuation Semantics. Sci. Comput. Program. 16 (1) (1991)
Mitchell Wand, Zheng-Yu Wang
Conditional Lambda-Theories and the Verification of Static Properties of Programs LICS (1990)
Mitchell Wand
A Short Proof of the Lexical Addressing Algorithm. Inf. Process. Lett. 35 (1) (1990)
Mitchell Wand, Patrick O'Keefe
On the Complexity of Type Inference with Coercion. FPCA (1989)
Mitchell Wand
Type Inference for Record Concatenation and Multiple Inheritance LICS (1989)
Margaret Montenyohl, Mitchell Wand
Incorporating Static Analysis in a Combinator-Based Compiler Inf. Comput. 82 (2) (1989)
Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, Bruce F. Duba
Abstract Continuations: A Mathematical Semantics for Handling Full Jumps. LISP and Functional Programming (1988)
Mitchell Wand
Corrigendum: Complete Type Inference for Simple Objects LICS (1988)
Mitchell Wand, Daniel P. Friedman
The Mystery of the Tower Revealed: A Nonreflective Description of the Reflective Tower. LISP Symb. Comput. 1 (1) (1988)
Margaret Montenyohl, Mitchell Wand
Correct Flow Analysis in Continuation Semantics. POPL (1988)
Mitchell Wand
Complete Type Inference for Simple Objects LICS (1987)
Eugene E. Kohlbecker, Mitchell Wand
Macro-by-Example: Deriving Syntactic Transformations from their Specifications. POPL (1987)
Stefan Kölbl, Mitchell Wand
Linear Future Semantics and Its Implementation. Sci. Comput. Program. 8 (1) (1987)
Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand
Obtaining Coroutines with Continuations. Comput. Lang. 11 (3/4) (1986)
Mitchell Wand
Finding the Source of Type Errors. POPL (1986)
Mitchell Wand, Daniel P. Friedman
The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower. LISP and Functional Programming (1986)
Mitchell Wand
From interpreter to compiler: a representational derivation. Programs as Data Objects (1985)
Mitchell Wand
Embedding Type Structure in Semantics. POPL (1985)
Albert R. Meyer, Mitchell Wand
Continuation Semantics in Typed Lambda-Calculi (Summary). Logic of Programs (1985)
Daniel P. Friedman, Mitchell Wand
Reification: Reflection without Metaphysics. LISP and Functional Programming (1984)
Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand
Continuations and Coroutines. LISP and Functional Programming (1984)
Mitchell Wand
A Types-as-Sets Semantics for Milner-Style Polymorphism. POPL (1984)
Mitchell Wand
A semantic prototyping system. SIGPLAN Symposium on Compiler Construction (1984)
Mitchell Wand
Loops in Combinator-Based Compilers. POPL (1983)
Mitchell Wand
Loops in Combinator-Based Compilers Inf. Control. 57 (2/3) (1983)
Mitchell Wand
Deriving Target Code as a Representation of Continuation Semantics. ACM Trans. Program. Lang. Syst. 4 (3) (1982)
Mitchell Wand
Semantics-Directed Machine Architecture. POPL (1982)
Mitchell Wand
Specifications, Models, and Implementations of Data Abstractions. Theor. Comput. Sci. 20 (1982)
Mitchell Wand
Continuation-Based Multiprocessing. LISP Conference (1980)
Mitchell Wand
First-Order Identities as a Defining Language. Acta Informatica 14 (1980)
Mitchell Wand
Continuation-Based Program Transformation Strategies. J. ACM 27 (1) (1980)
Mitchell Wand
Fixed-Point Constructions in Order-Enriched Categories. Theor. Comput. Sci. 8 (1979)
Mitchell Wand
Final Algebra Semantics and Data Type Extensions. J. Comput. Syst. Sci. 19 (1) (1979)
Mitchell Wand, Daniel P. Friedman
Compiling Lambda-Expressions Using Continuations and Factorizations. Comput. Lang. 3 (4) (1978)
Mitchell Wand
A New Incompleteness Result for Hoare's System. J. ACM 25 (1) (1978)
Mitchell Wand
A Characterization of Weakest Preconditions. J. Comput. Syst. Sci. 15 (2) (1977)
Daniel P. Friedman, David S. Wise, Mitchell Wand
Recursive programming through table look-up. SYMSACC (1976)
Mitchell Wand
A New Incompleteness Result for Hoare's System STOC (1976)
Mitchell Wand
On the recursive specification of data types. Category Theory Applied to Computation and Control (1974)

Mitchell Wand.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mitchell Wand