Travelled to:1 × Belgium
1 × Canada
1 × Hungary
1 × Italy
1 × The Netherlands
2 × Austria
2 × Germany
2 × Sweden
24 × USA
3 × United Kingdom
4 × France
Collaborated with:∅ D.P.Friedman P.Stansifer V.Koutavas P.Steckler P.O'Keefe A.J.Turon C.Dimoulas D.Herman O.Shivers D.Vaillancourt G.B.Williamson J.Ovlinger I.Siveroni G.T.Sullivan D.Oliva Z.Wang M.Montenyohl E.E.Kohlbecker J.Tiuryn S.E.Ganz J.G.R.Jr. C.T.Haynes M.Felleisen B.F.Duba
Talks about:type (11) semant (8) program (5) object (5) infer (5) reflect (4) correct (4) continu (4) system (4) base (4)
Person: Mitchell Wand
DBLP: Wand:Mitchell
Facilitated 1 volumes:
EdContributed to:
2014
2011
2011
2009
2008200620062005200420032002
20011999
199919991997
1996
19951994
199419931992
1992
1990198919891988198819881987198719861986198519841984
1984198319821980
19761973
1972
1993Wrote 45 papers:
- ICFP-2014-StansiferW #flexibility #named #programming
- Romeo: a system for more flexible binding-safe programming (PS, MW), pp. 53–65.
- LDTA-2011-StansiferW #parsing
- Parsing reflective grammars (PS, MW), p. 10.
- POPL-2011-TuronW #concurrent #logic
- A separation logic for refining concurrent objects (AJT, MW), pp. 247–258.
- VMCAI-2009-DimoulasW #higher-order #problem
- The Higher-Order Aggregate Update Problem (CD, MW), pp. 44–58.
- ESOP-2008-HermanW #formal method #metaprogramming
- A Theory of Hygienic Macros (DH, MW), pp. 48–62.
- ESOP-2006-KoutavasW #bisimulation #imperative
- Bisimulations for Untyped Imperative Objects (VK, MW), pp. 146–161.
- POPL-2006-KoutavasW #bisimulation #higher-order #imperative #reasoning #source code
- Small bisimulations for reasoning about higher-order imperative programs (VK, MW), pp. 141–152.
- ESOP-2005-ShiversW #bottom-up
- Bottom-Up β-Reduction: Uplinks and λ-DAGs (OS, MW), pp. 217–232.
- ICFP-2004-WandV #backtracking #modelling
- Relating models of backtracking (MW, DV), pp. 54–65.
- ICFP-2003-Wand #aspect-oriented #comprehension
- Understanding aspects: extended abstract (MW), pp. 299–300.
- ESOP-2002-WandW #analysis #composition #proving
- A Modular, Extensible Proof Method for Small-Step Flow Analyses (MW, GBW), pp. 213–227.
- SAIG-2001-Wand #aspect-oriented #programming #semantics
- A Semantics for Advice and Dynamic Join Points in Aspect-Oriented Programming (MW), pp. 45–46.
- ICFP-1999-GanzFW
- Trampolined Style (SEG, DPF, MW), pp. 18–27.
- OOPSLA-1999-OvlingerW #recursion #specification #traversal
- A Language for Specifying Recursive Traversals of Object Structures (JO, MW), pp. 70–81.
- POPL-1999-WandS #constraints
- Constraint Systems for Useless Variable Elimination (MW, IS), pp. 291–302.
- POPL-1997-WandS #semantics #using
- Denotational Semantics Using an Operationally-Based Term Model (MW, GTS), pp. 386–399.
- ECOOP-1996-RossieFW #inheritance #modelling
- Modeling Subobject-based Inheritance (JGRJ, DPF, MW), pp. 248–274.
- FPCA-1995-Wand #compilation #correctness #parallel
- Compiler Correctness for Parallel Languages (MW), pp. 120–134.
- POPL-1994-WandS #lightweight
- Selective and Lightweight Closure Conversion (MW, PS), pp. 435–445.
- SAS-1994-StecklerW
- Selective Thunkification (PS, MW), pp. 162–178.
- POPL-1993-Wand #analysis #correctness #specification
- Specifying the Correctness of Binding-Time Analysis (MW), pp. 137–143.
- ESOP-1992-OKeefeW #decidability #type inference
- Type Inference for Partial Types is Decidable (PO, MW), pp. 408–417.
- LFP-1992-WandO #correctness #proving
- Proving the Correctness of Storage Representations (MW, DO), pp. 151–160.
- LICS-1990-WandW #source code #verification
- Conditional λ-Theories and the Verification of Static Properties of Programs (MW, ZYW), pp. 321–332.
- FPCA-1989-WandO #complexity #on the #type inference
- On the Complexity of Type Inference with Coercion (MW, PO), pp. 293–298.
- LICS-1989-Wand #inheritance #multi #type inference
- Type Inference for Record Concatenation and Multiple Inheritance (MW), pp. 92–97.
- LFP-1988-FelleisenWFD #continuation #semantics
- Abstract Continuations: A Mathematical Semantics for Handling Full Jumps (MF, MW, DPF, BFD), pp. 52–62.
- LICS-1988-Wand #named #type inference
- Corrigendum: Complete Type Inference for Simple Objects (MW), p. 132.
- POPL-1988-MontenyohlW #analysis #continuation #semantics
- Correct Flow Analysis in Continuation Semantics (MM, MW), pp. 204–218.
- LICS-1987-Wand #type inference
- Complete Type Inference for Simple Objects (MW), pp. 37–44.
- POPL-1987-KohlbeckerW #metaprogramming #named #specification
- Macro-by-Example: Deriving Syntactic Transformations from their Specifications (EEK, MW), pp. 77–84.
- LFP-1986-WandF
- The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower (MW, DPF), pp. 298–307.
- POPL-1986-Wand #fault
- Finding the Source of Type Errors (MW), pp. 38–43.
- POPL-1985-Wand #semantics
- Embedding Type Structure in Semantics (MW), pp. 1–6.
- LFP-1984-FriedmanW #named
- Reification: Reflection without Metaphysics (DPF, MW), pp. 348–355.
- LFP-1984-HaynesFW #continuation
- Continuations and Coroutines (CTH, DPF, MW), pp. 293–298.
- POPL-1984-Wand #morphism #polymorphism #semantics
- A Types-as-Sets Semantics for Milner-Style Polymorphism (MW), pp. 158–164.
- SCC-1984-Wand #prototype #semantics
- A semantic prototyping system (MW), pp. 213–221.
- POPL-1983-Wand #combinator #compilation
- Loops in Combinator-Based Compilers (MW), pp. 190–196.
- POPL-1982-Wand #architecture #semantics
- Semantics-Directed Machine Architecture (MW), pp. 234–241.
- LISP-1980-Wand #multi
- Continuation-Based Multiprocessing (MW), pp. 19–28.
- STOC-1976-Wand #hoare
- A New Incompleteness Result for Hoare’s System (MW), pp. 87–91.
- STOC-1973-Wand
- An Unusual Application of Program-Proving (MW), pp. 59–66.
- ICALP-1972-Wand #approach #recursion
- A Concrete Approach to Abstract Recursion Definitions (MW), pp. 331–341.
- TAPSOFT-1993-TiurynW #re-engineering #recursion #type system
- Type Reconstruction with Recursive Types and Atomic Subtyping (JT, MW), pp. 686–701.