Mitchell Wand - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Parsing reflective grammarsPaul Stansifer, Mitchell Wand. LDTA 2011: 10 [doi]

A separation logic for refining concurrent objectsAaron Joseph Turon, Mitchell Wand. POPL 2011: 247-258 [doi]

2010

Bottom-up beta-reduction: Uplinks and lambda-DAGsOlin Shivers, Mitchell Wand. FUIN, 103(1-4):247-287, 2010. [doi]

2009

The Higher-Order Aggregate Update ProblemChristos Dimoulas, Mitchell Wand. vmcai 2009: 44-58 [doi]

2008

Essentials of programming languages (3. ed.)Daniel P. Friedman, Mitchell Wand. MIT Press, 2008.

A Theory of Hygienic MacrosDavid Herman, Mitchell Wand. ESOP 2008: 48-62 [doi]

A Compositional Trace Semantics for OrcDimitrios Vardoulakis, Mitchell Wand. coordination 2008: 331-346 [doi]

Programming languages: fundamental concepts for expanding and disciplining the mindMitchell Wand, Daniel P. Friedman. SIGPLAN, 43(11):133-135, 2008. [doi]

2007

On the correctness of the Krivine machineMitchell Wand. lisp, 20(3):231-235, 2007. [doi]

2006

Small bisimulations for reasoning about higher-order imperative programsVasileios Koutavas, Mitchell Wand. POPL 2006: 141-152 [doi]

Bisimulations for Untyped Imperative ObjectsVasileios Koutavas, Mitchell Wand. ESOP 2006: 146-161 [doi]

2005

Selectors Make Set-Based Analysis Too HardPhilippe Meunier, Robby Findler, Paul Steckler, Mitchell Wand. lisp, 18(3-4):245-269, 2005. [doi]

Bottom-Up beta-Reduction: Uplinks and lambda-DAGsOlin Shivers, Mitchell Wand. ESOP 2005: 217-232 [doi]

2004

A semantics for advice and dynamic join points in aspect-oriented programmingMitchell Wand, Gregor Kiczales, Christopher Dutchyn. TOPLAS, 26(5):890-910, 2004. [doi]

Relating models of backtrackingMitchell Wand, Dale Vaillancourt. ICFP 2004: 54-65 [doi]

2003

CPS transformation of flow informationJens Palsberg, Mitchell Wand. JFP, 13(5):905-923, 2003. [doi]

Understanding aspects: extended abstractMitchell Wand. SIGPLAN, 38(9):299-300, 2003. [doi]

Understanding aspects: extended abstractMitchell Wand. ICFP 2003: 299-300 [doi]

2002

A Modular, Extensible Proof Method for Small-Step Flow AnalysesMitchell Wand, Galen B. Williamson. ESOP 2002: 213-227 [doi]

2001

Essentials of programming languages (2. ed.)Daniel P. Friedman, Mitchell Wand, Christopher T. Haynes. MIT Press, 2001.

A Semantics for Advice and Dynamic Join Points in Aspect-Oriented ProgrammingMitchell Wand. saig 2001: 45-46 [doi]

Set constraints for destructive array update optimizationMitchell Wand, William D. Clinger. JFP, 11(3):319-346, 2001.

1999

1998

1997

Type Inference with Non-Structural SubtypingJens Palsberg, Mitchell Wand, Patrick O Keefe. fac, 9(1):49-67, 1997.

Lightweight Closure ConversionPaul Steckler, Mitchell Wand. TOPLAS, 19(1):48-86, 1997. [doi]

Denotational Semantics Using an Operationally-Based Term ModelMitchell Wand, Gregory T. Sullivan. POPL 1997: 386-399 [doi]

1996

Compiler Correctness for Concurrent LanguagesDavid S. Gladstein, Mitchell Wand. coordination 1996: 231-248

Modeling Subobject-based InheritanceJonathan G. Rossie Jr., Daniel P. Friedman, Mitchell Wand. ECOOP 1996: 248-274 [doi]

Untyped Lambda-Calculus with Input-OutputJerzy Tiuryn, Mitchell Wand. caap 1996: 317-329

1995

VLISP: A Verified Implementation of SchemeJoshua D. Guttman, John D. Ramsdell, Mitchell Wand. lisp, 8(1-2):5-32, 1995.

The VLISP Verified PreScheme CompilerDino Oliva, John D. Ramsdell, Mitchell Wand. lisp, 8(1-2):111-182, 1995.

Strong Normalization with Non-Structural SubtypingMitchell Wand, Patrick O Keefe, Jens Palsberg. mscs, 5(3):419-429, 1995.

Compiler Correctness for Parallel LanguagesMitchell Wand. fpca 1995: 120-134

1994

Selective ThunkificationPaul Steckler, Mitchell Wand. SAS 1994: 162-178

Selective and Lightweight Closure ConversionMitchell Wand, Paul Steckler. POPL 1994: 435-445

Conditional Lambda-Theories and the Verification of Static Properties of ProgramsMitchell Wand, Zheng-Yu Wang. iandc, 113(2):253-277, September 1994.

1993

Type Reconstruction with Recursive Types and Atomic SubtypingJerzy Tiuryn, Mitchell Wand. tapsoft 1993: 686-701

Specifying the Correctness of Binding-Time AnalysisMitchell Wand. JFP, 3(3):365-387, 1993.

Specifying the Correctness of Binding-Time AnalysisMitchell Wand. POPL 1993: 137-143

1992

Essentials of programming languagesDaniel P. Friedman, Mitchell Wand, Christopher T. Haynes. MIT Press, 1992.

Type Inference for Partial Types is DecidablePatrick O Keefe, Mitchell Wand. ESOP 1992: 408-417

Proving the Correctness of Storage RepresentationsMitchell Wand, Dino Oliva. lfp 1992: 151-160 [doi]

1991

Correctness of Static Flow Analysis in Continuation SemanticsMargaret Montenyohl, Mitchell Wand. SCP, 16(1):1-18, 1991.

Automatic Dimensional InferenceMitchell Wand, Patrick O Keefe. BIRTHDAY 1991: 479-483

Correctness of Procedure Representations in Higher-Order Assembly LanguageMitchell Wand. mfps 1992: 294-311

Type Inference for Record Concatenation and Multiple InheritanceMitchell Wand. iandc, 93(1):1-15, July 1991.

1990

A Short Proof of the Lexical Addressing AlgorithmMitchell Wand. ipl, 35(1):1-5, 1990.

Conditional Lambda-Theories and the Verification of Static Properties of ProgramsMitchell Wand, Zheng-Yu Wang. lics 1990: 321-332

1989

Incorporating Static Analysis in a Combinator-Based CompilerMargaret Montenyohl, Mitchell Wand. iandc, 82(2):151-184, August 1989.

On the Complexity of Type Inference with CoercionMitchell Wand, Patrick O Keefe. fpca 1989: 293-298 [doi]

Type Inference for Record Concatenation and Multiple InheritanceMitchell Wand. lics 1989: 92-97

1988

Abstract Continuations: A Mathematical Semantics for Handling Full JumpsMatthias Felleisen, Mitchell Wand, Daniel P. Friedman, Bruce F. Duba. lfp 1988: 52-62 [doi]

Correct Flow Analysis in Continuation SemanticsMargaret Montenyohl, Mitchell Wand. POPL 1988: 204-218

The Mystery of the Tower Revealed: A Nonreflective Description of the Reflective TowerMitchell Wand, Daniel P. Friedman. lisp, 1(1):11-37, 1988.

Corrigendum: Complete Type Inference for Simple ObjectsMitchell Wand. lics 1988: 132

1987

Macro-by-Example: Deriving Syntactic Transformations from their SpecificationsEugene E. Kohlbecker, Mitchell Wand. POPL 1987: 77-84

Linear Future Semantics and Its ImplementationStefan Kölbl, Mitchell Wand. SCP, 8(1):87-103, 1987.

Complete Type Inference for Simple ObjectsMitchell Wand. lics 1987: 37-44

1986

Obtaining Coroutines with ContinuationsChristopher T. Haynes, Daniel P. Friedman, Mitchell Wand. Comp. Lang., Syst. \& Struct., 11(3/4):143-153, 1986.

The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective TowerMitchell Wand, Daniel P. Friedman. lfp 1986: 298-307

Finding the Source of Type ErrorsMitchell Wand. POPL 1986: 38-43

1985

Continuation Semantics in Typed Lambda-Calculi (Summary)Albert R. Meyer, Mitchell Wand. lop 1985: 219-224

Embedding Type Structure in SemanticsMitchell Wand. POPL 1985: 1-6

From interpreter to compiler: a representational derivationMitchell Wand. pdo 1986: 306-324

1984

Reification: Reflection without MetaphysicsDaniel P. Friedman, Mitchell Wand. lfp 1984: 348-355

Continuations and CoroutinesChristopher T. Haynes, Daniel P. Friedman, Mitchell Wand. lfp 1984: 293-298

A semantic prototyping systemMitchell Wand. sigplan 1984: 213-221 [doi]

A Types-as-Sets Semantics for Milner-Style PolymorphismMitchell Wand. POPL 1984: 158-164

1983

Loops in Combinator-Based CompilersMitchell Wand. iandc, 57(2/3):148-164, May/June 1983.

Loops in Combinator-Based CompilersMitchell Wand. POPL 1983: 190-196

1982

Deriving Target Code as a Representation of Continuation SemanticsMitchell Wand. TOPLAS, 4(3):496-517, 1982. [doi]

Semantics-Directed Machine ArchitectureMitchell Wand. POPL 1982: 234-241

Specifications, Models, and Implementations of Data AbstractionsMitchell Wand. TCS, 20:3-32, 1982.

1980

First-Order Identities as a Defining LanguageMitchell Wand. ACTA, 14:337-357, 1980.

Continuation-Based Program Transformation StrategiesMitchell Wand. JACM, 27(1):164-180, 1980. [doi]

Continuation-Based MultiprocessingMitchell Wand. lfp 1980: 19-28

1979

Fixed-Point Constructions in Order-Enriched CategoriesMitchell Wand. TCS, 8:13-30, 1979.

Final Algebra Semantics and Data Type ExtensionsMitchell Wand. jcss, 19(1):27-44, 1979.

1978

A New Incompleteness Result for Hoare s SystemMitchell Wand. JACM, 25(1):168-175, 1978. [doi]

Compiling Lambda-Expressions Using Continuations and FactorizationsMitchell Wand, Daniel P. Friedman. Comp. Lang., Syst. \& Struct., 3(4):241-263, 1978.

1977

A Characterization of Weakest PreconditionsMitchell Wand. jcss, 15(2):209-212, 1977.

1976

A New Incompleteness Result for Hoare s SystemMitchell Wand. stoc 1976: 87-91

1974

An algebraic formulation of the Chomsky hierarchyMitchell Wand. category 1975: 209-213

On the recursive specification of data typesMitchell Wand. category 1975: 214-217

1973

An Unusual Application of Program-ProvingMitchell Wand. stoc 1973: 59-66

1972

A Concrete Approach to Abstract Recursion DefinitionsMitchell Wand. icalp 1972: 331-341