 | 2009 |
|---|
| 87 |       | Christos Dimoulas,
Mitchell Wand:
The Higher-Order Aggregate Update Problem.
VMCAI 2009: 44-58 |
| 2008 |
|---|
| 86 | | Dimitrios Vardoulakis,
Mitchell Wand:
A Compositional Trace Semantics for Orc.
COORDINATION 2008: 331-346 |
| 85 | | David Herman,
Mitchell Wand:
A Theory of Hygienic Macros.
ESOP 2008: 48-62 |
| 84 | | Mitchell Wand,
Daniel P. Friedman:
Programming languages: fundamental concepts for expanding and disciplining the mind.
SIGPLAN Notices 43(11): 133-135 (2008) |
| 83 | | 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.
SIGPLAN Notices 43(11): 6-29 (2008) |
| 2007 |
|---|
| 82 | | Mitchell Wand:
On the correctness of the Krivine machine.
Higher-Order and Symbolic Computation 20(3): 231-235 (2007) |
| 2006 |
|---|
| 81 | | Vasileios Koutavas,
Mitchell Wand:
Bisimulations for Untyped Imperative Objects.
ESOP 2006: 146-161 |
| 80 | | Vasileios Koutavas,
Mitchell Wand:
Small bisimulations for reasoning about higher-order imperative programs.
POPL 2006: 141-152 |
| 2005 |
|---|
| 79 | | Olin Shivers,
Mitchell Wand:
Bottom-Up beta-Reduction: Uplinks and lambda-DAGs.
ESOP 2005: 217-232 |
| 78 | | Philippe Meunier,
Robert Bruce Findler,
Paul Steckler,
Mitchell Wand:
Selectors Make Set-Based Analysis Too Hard.
Higher-Order and Symbolic Computation 18(3-4): 245-269 (2005) |
| 2004 |
|---|
| 77 | | Mitchell Wand,
Dale Vaillancourt:
Relating models of backtracking.
ICFP 2004: 54-65 |
| 76 | | 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): 890-910 (2004) |
| 2003 |
|---|
| 75 | | Mitchell Wand:
Understanding aspects: extended abstract.
ICFP 2003: 299-300 |
| 74 | | Jens Palsberg,
Mitchell Wand:
CPS transformation of flow information.
J. Funct. Program. 13(5): 905-923 (2003) |
| 2002 |
|---|
| 73 | | Mitchell Wand,
Galen B. Williamson:
A Modular, Extensible Proof Method for Small-Step Flow Analyses.
ESOP 2002: 213-227 |
| 2001 |
|---|
| 72 | | Mitchell Wand:
A Semantics for Advice and Dynamic Join Points in Aspect-Oriented Programming.
SAIG 2001: 45-46 |
| 71 |  | Mitchell Wand,
William D. Clinger:
Set constraints for destructive array update optimization.
J. Funct. Program. 11(3): 319-346 (2001) |
| 1999 |
|---|
| 70 | | Steven E. Ganz,
Daniel P. Friedman,
Mitchell Wand:
Trampolined Style.
ICFP 1999: 18-27 |
| 69 | | Johan Ovlinger,
Mitchell Wand:
A Language for Specifying Recursive Traversals of Object Structures.
OOPSLA 1999: 70-81 |
| 68 | | Mitchell Wand,
Igor Siveroni:
Constraint Systems for Useless Variable Elimination.
POPL 1999: 291-302 |
| 67 | | Mitchell Wand:
Continuation-Based Multiprocessing Revisited.
Higher-Order and Symbolic Computation 12(3): 283 (1999) |
| 66 | | Mitchell Wand:
Continuation-Based Multiprocessing.
Higher-Order and Symbolic Computation 12(3): 285-299 (1999) |
| 1998 |
|---|
| 65 | | Mitchell Wand,
William D. Clinger:
Set Constraints for Destructive Array Update Optimization.
ICCL 1998: 184- |
| 64 | | 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.
Higher-Order and Symbolic Computation 11(1): 7-105 (1998) |
| 63 | | Mitchell Wand:
The Theory of Fexprs is Trivial.
Lisp and Symbolic Computation 10(3): 189-199 (1998) |
| 1997 |
|---|
| 62 | | Mitchell Wand,
Gregory T. Sullivan:
Denotational Semantics Using an Operationally-Based Term Model.
POPL 1997: 386-399 |
| 61 | | Paul Steckler,
Mitchell Wand:
Lightweight Closure Conversion.
ACM Trans. Program. Lang. Syst. 19(1): 48-86 (1997) |
| 60 | | Jens Palsberg,
Mitchell Wand,
Patrick O'Keefe:
Type Inference with Non-Structural Subtyping.
Formal Asp. Comput. 9(1): 49-67 (1997) |
| 1996 |
|---|
| 59 | | Jerzy Tiuryn,
Mitchell Wand:
Untyped Lambda-Calculus with Input-Output.
CAAP 1996: 317-329 |
| 58 | | David S. Gladstein,
Mitchell Wand:
Compiler Correctness for Concurrent Languages.
COORDINATION 1996: 231-248 |
| 57 | | Jonathan G. Rossie Jr.,
Daniel P. Friedman,
Mitchell Wand:
Modeling Subobject-based Inheritance.
ECOOP 1996: 248-274 |
| 1995 |
|---|
| 56 | | Mitchell Wand:
Compiler Correctness for Parallel Languages.
FPCA 1995: 120-134 |
| 55 | | Dino Oliva,
John D. Ramsdell,
Mitchell Wand:
The VLISP Verified PreScheme Compiler.
Lisp and Symbolic Computation 8(1-2): 111-182 (1995) |
| 54 | | Joshua D. Guttman,
John D. Ramsdell,
Mitchell Wand:
VLISP: A Verified Implementation of Scheme.
Lisp and Symbolic Computation 8(1-2): 5-32 (1995) |
| 53 | | Mitchell Wand,
Patrick O'Keefe,
Jens Palsberg:
Strong Normalization with Non-Structural Subtyping.
Mathematical Structures in Computer Science 5(3): 419-429 (1995) |
| 1994 |
|---|
| 52 | | Mitchell Wand,
Paul Steckler:
Selective and Lightweight Closure Conversion.
POPL 1994: 435-445 |
| 51 | | Paul Steckler,
Mitchell Wand:
Selective Thunkification.
SAS 1994: 162-178 |
| 50 | | Mitchell Wand,
Zheng-Yu Wang:
Conditional Lambda-Theories and the Verification of Static Properties of Programs
Inf. Comput. 113(2): 253-277 (1994) |
| 1993 |
|---|
| 49 | | Mitchell Wand:
Specifying the Correctness of Binding-Time Analysis.
POPL 1993: 137-143 |
| 48 | | Jerzy Tiuryn,
Mitchell Wand:
Type Reconstruction with Recursive Types and Atomic Subtyping.
TAPSOFT 1993: 686-701 |
| 47 | | Mitchell Wand:
Specifying the Correctness of Binding-Time Analysis.
J. Funct. Program. 3(3): 365-387 (1993) |
| 1992 |
|---|
| 46 | | Patrick O'Keefe,
Mitchell Wand:
Type Inference for Partial Types is Decidable.
ESOP 1992: 408-417 |
| 45 | | Mitchell Wand,
Dino Oliva:
Proving the Correctness of Storage Representations.
LISP and Functional Programming 1992: 151-160 |
| 1991 |
|---|
| 44 | | Mitchell Wand,
Patrick O'Keefe:
Automatic Dimensional Inference.
Computational Logic - Essays in Honor of Alan Robinson 1991: 479-483 |
| 43 | | Mitchell Wand:
Correctness of Procedure Representations in Higher-Order Assembly Language.
MFPS 1991: 294-311 |
| 42 | | Mitchell Wand:
Type Inference for Record Concatenation and Multiple Inheritance
Inf. Comput. 93(1): 1-15 (1991) |
| 41 | | Margaret Montenyohl,
Mitchell Wand:
Correctness of Static Flow Analysis in Continuation Semantics.
Sci. Comput. Program. 16(1): 1-18 (1991) |
| 1990 |
|---|
| 40 | | Mitchell Wand,
Zheng-Yu Wang:
Conditional Lambda-Theories and the Verification of Static Properties of Programs
LICS 1990: 321-332 |
| 39 | | Mitchell Wand:
A Short Proof of the Lexical Addressing Algorithm.
Inf. Process. Lett. 35(1): 1-5 (1990) |
| 1989 |
|---|
| 38 | | Mitchell Wand,
Patrick O'Keefe:
On the Complexity of Type Inference with Coercion.
FPCA 1989: 293-298 |
| 37 | | Mitchell Wand:
Type Inference for Record Concatenation and Multiple Inheritance
LICS 1989: 92-97 |
| 36 | | Margaret Montenyohl,
Mitchell Wand:
Incorporating Static Analysis in a Combinator-Based Compiler
Inf. Comput. 82(2): 151-184 (1989) |
| 1988 |
|---|
| 35 | | Mitchell Wand:
Corrigendum: Complete Type Inference for Simple Objects
LICS 1988: 132 |
| 34 | | Matthias Felleisen,
Mitchell Wand,
Daniel P. Friedman,
Bruce F. Duba:
Abstract Continuations: A Mathematical Semantics for Handling Full Jumps.
LISP and Functional Programming 1988: 52-62 |
| 33 | | Margaret Montenyohl,
Mitchell Wand:
Correct Flow Analysis in Continuation Semantics.
POPL 1988: 204-218 |
| 32 | | Mitchell Wand,
Daniel P. Friedman:
The Mystery of the Tower Revealed: A Nonreflective Description of the Reflective Tower.
Lisp and Symbolic Computation 1(1): 11-37 (1988) |
| 1987 |
|---|
| 31 | | Mitchell Wand:
Complete Type Inference for Simple Objects
LICS 1987: 37-44 |
| 30 | | Eugene E. Kohlbecker,
Mitchell Wand:
Macro-by-Example: Deriving Syntactic Transformations from their Specifications.
POPL 1987: 77-84 |
| 29 | | Stefan Kölbl,
Mitchell Wand:
Linear Future Semantics and Its Implementation.
Sci. Comput. Program. 8(1): 87-103 (1987) |
| 1986 |
|---|
| 28 | | Mitchell Wand,
Daniel P. Friedman:
The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower.
LISP and Functional Programming 1986: 298-307 |
| 27 | | Mitchell Wand:
Finding the Source of Type Errors.
POPL 1986: 38-43 |
| 26 | | Christopher T. Haynes,
Daniel P. Friedman,
Mitchell Wand:
Obtaining Coroutines with Continuations.
Comput. Lang. 11(3/4): 143-153 (1986) |
| 1985 |
|---|
| 25 | | Albert R. Meyer,
Mitchell Wand:
Continuation Semantics in Typed Lambda-Calculi (Summary).
Logic of Programs 1985: 219-224 |
| 24 | | Mitchell Wand:
Embedding Type Structure in Semantics.
POPL 1985: 1-6 |
| 23 | | Mitchell Wand:
From interpreter to compiler: a representational derivation.
Programs as Data Objects 1985: 306-324 |
| 1984 |
|---|
| 22 | | Christopher T. Haynes,
Daniel P. Friedman,
Mitchell Wand:
Continuations and Coroutines.
LISP and Functional Programming 1984: 293-298 |
| 21 | | Daniel P. Friedman,
Mitchell Wand:
Reification: Reflection without Metaphysics.
LISP and Functional Programming 1984: 348-355 |
| 20 | | Mitchell Wand:
A Types-as-Sets Semantics for Milner-Style Polymorphism.
POPL 1984: 158-164 |
| 19 | | Mitchell Wand:
A semantic prototyping system.
SIGPLAN Symposium on Compiler Construction 1984: 213-221 |
| 1983 |
|---|
| 18 | | Mitchell Wand:
Loops in Combinator-Based Compilers.
POPL 1983: 190-196 |
| 17 | | Mitchell Wand:
Loops in Combinator-Based Compilers
Information and Control 57(2/3): 148-164 (1983) |
| 1982 |
|---|
| 16 | | Mitchell Wand:
Semantics-Directed Machine Architecture.
POPL 1982: 234-241 |
| 15 | | Mitchell Wand:
Deriving Target Code as a Representation of Continuation Semantics.
ACM Trans. Program. Lang. Syst. 4(3): 496-517 (1982) |
| 14 | | Mitchell Wand:
Specifications, Models, and Implementations of Data Abstractions.
Theor. Comput. Sci. 20: 3-32 (1982) |
| 1980 |
|---|
| 13 | | Mitchell Wand:
Continuation-Based Multiprocessing.
LISP Conference 1980: 19-28 |
| 12 | | Mitchell Wand:
First-Order Identities as a Defining Language.
Acta Inf. 14: 337-357 (1980) |
| 11 | | Mitchell Wand:
Continuation-Based Program Transformation Strategies.
J. ACM 27(1): 164-180 (1980) |
| 1979 |
|---|
| 10 | | Mitchell Wand:
Final Algebra Semantics and Data Type Extensions.
J. Comput. Syst. Sci. 19(1): 27-44 (1979) |
| 9 | | Mitchell Wand:
Fixed-Point Constructions in Order-Enriched Categories.
Theor. Comput. Sci. 8: 13-30 (1979) |
| 1978 |
|---|
| 8 | | Mitchell Wand,
Daniel P. Friedman:
Compiling Lambda-Expressions Using Continuations and Factorizations.
Comput. Lang. 3(4): 241-263 (1978) |
| 7 | | Mitchell Wand:
A New Incompleteness Result for Hoare's System.
J. ACM 25(1): 168-175 (1978) |
| 1977 |
|---|
| 6 | | Mitchell Wand:
A Characterization of Weakest Preconditions.
J. Comput. Syst. Sci. 15(2): 209-212 (1977) |
| 1976 |
|---|
| 5 | | Mitchell Wand:
A New Incompleteness Result for Hoare's System
STOC 1976: 87-91 |
| 1974 |
|---|
| 4 | | Mitchell Wand:
An algebraic formulation of the Chomsky hierarchy.
Category Theory Applied to Computation and Control 1974: 209-213 |
| 3 | | Mitchell Wand:
On the recursive specification of data types.
Category Theory Applied to Computation and Control 1974: 214-217 |
| 1973 |
|---|
| 2 | | Mitchell Wand:
An Unusual Application of Program-Proving
STOC 1973: 59-66 |
| 1972 |
|---|
| 1 | | Mitchell Wand:
A Concrete Approach to Abstract Recursion Definitions.
ICALP 1972: 331-341 |
