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