default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMitchell Wand
Person information
- affiliation: Northeastern University, Boston, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j42]William D. Clinger, Mitchell Wand:
Hygienic macro technology. Proc. ACM Program. Lang. 4(HOPL): 80:1-80:110 (2020)
2010 – 2019
- 2018
- [j41]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): 87:1-87:30 (2018) - [i3]Mitchell Wand, Ryan Culpepper, Theophilos Giannakopoulos, Andrew Cobb:
Contextual Equivalence for a Probabilistic Language with Continuous Random Variables and Recursion. CoRR abs/1807.02809 (2018) - 2017
- [j40]Justin Pombrio, Shriram Krishnamurthi
, Mitchell Wand:
Inferring scope through syntactic sugar. Proc. ACM Program. Lang. 1(ICFP): 44:1-44:28 (2017) - 2016
- [j39]Paul Stansifer, Mitchell Wand:
Romeo: A system for more flexible binding-safe programming. J. Funct. Program. 26: e13 (2016) - 2014
- [c57]Paul Stansifer, Mitchell Wand:
Romeo: a system for more flexible binding-safe programming. ICFP 2014: 53-65 - 2011
- [c56]Paul Stansifer, Mitchell Wand:
Parsing reflective grammars. LDTA 2011: 10 - [c55]Aaron Joseph Turon, Mitchell Wand:
A separation logic for refining concurrent objects. POPL 2011: 247-258 - [c54]Aaron Joseph Turon, Mitchell Wand:
A Resource Analysis of the π-calculus. MFPS 2011: 313-334 - [i2]Paul Stansifer, Mitchell Wand:
Parsing Reflective Grammars. CoRR abs/1102.2003 (2011) - [i1]Aaron Joseph Turon, Mitchell Wand:
A resource analysis of the pi-calculus. CoRR abs/1105.0966 (2011) - 2010
- [j38]Olin Shivers, Mitchell Wand:
Bottom-up beta-reduction: Uplinks and lambda-DAGs. Fundam. Informaticae 103(1-4): 247-287 (2010)
2000 – 2009
- 2009
- [c53]Christos Dimoulas, Mitchell Wand:
The Higher-Order Aggregate Update Problem. VMCAI 2009: 44-58 - 2008
- [b3]Daniel P. Friedman, Mitchell Wand:
Essentials of programming languages (3. ed.). MIT Press 2008, ISBN 978-0-262-06279-4, pp. I-XXII, 1-410 - [j37]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): 6-29 (2008) - [j36]Mitchell Wand, Daniel P. Friedman:
Programming languages: fundamental concepts for expanding and disciplining the mind. ACM SIGPLAN Notices 43(11): 133-135 (2008) - [c52]Dimitrios Vardoulakis, Mitchell Wand:
A Compositional Trace Semantics for Orc. COORDINATION 2008: 331-346 - [c51]David Herman, Mitchell Wand:
A Theory of Hygienic Macros. ESOP 2008: 48-62 - 2007
- [j35]Mitchell Wand:
On the correctness of the Krivine machine. High. Order Symb. Comput. 20(3): 231-235 (2007) - 2006
- [c50]Vasileios Koutavas, Mitchell Wand:
Bisimulations for Untyped Imperative Objects. ESOP 2006: 146-161 - [c49]Vasileios Koutavas, Mitchell Wand:
Small bisimulations for reasoning about higher-order imperative programs. POPL 2006: 141-152 - 2005
- [j34]Philippe Meunier, Robert Bruce Findler, Paul Steckler, Mitchell Wand:
Selectors Make Set-Based Analysis Too Hard. High. Order Symb. Comput. 18(3-4): 245-269 (2005) - [c48]Olin Shivers, Mitchell Wand:
Bottom-Up beta-Reduction: Uplinks and lambda-DAGs. ESOP 2005: 217-232 - 2004
- [j33]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) - [c47]Mitchell Wand, Dale Vaillancourt:
Relating models of backtracking. ICFP 2004: 54-65 - 2003
- [j32]Jens Palsberg, Mitchell Wand:
CPS transformation of flow information. J. Funct. Program. 13(5): 905-923 (2003) - [c46]Mitchell Wand:
Understanding aspects: extended abstract. ICFP 2003: 299-300 - 2002
- [c45]Mitchell Wand, Galen B. Williamson:
A Modular, Extensible Proof Method for Small-Step Flow Analyses. ESOP 2002: 213-227 - [e1]Mitchell Wand, Simon L. Peyton Jones:
Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), Pittsburgh, Pennsylvania, USA, October 4-6, 2002. ACM 2002, ISBN 1-58113-487-8 [contents] - 2001
- [b2]Daniel P. Friedman, Mitchell Wand, Christopher T. Haynes:
Essentials of programming languages (2. ed.). MIT Press 2001, ISBN 978-0-262-06217-6, pp. I-XVIII, 1-389 - [j31]Mitchell Wand, William D. Clinger:
Set constraints for destructive array update optimization. J. Funct. Program. 11(3): 319-346 (2001) - [c44]Mitchell Wand:
A Semantics for Advice and Dynamic Join Points in Aspect-Oriented Programming. SAIG 2001: 45-46 - 2000
- [j30]Mitchell Wand:
Analysis-based program transformations. ACM SIGSOFT Softw. Eng. Notes 25(1): 91-92 (2000) - [j29]Mitchell Wand, William D. Clinger:
Optimizing memory usage in higher-order programming languages: theoretical and experimental studies. ACM SIGSOFT Softw. Eng. Notes 25(1): 92 (2000)
1990 – 1999
- 1999
- [j28]Mitchell Wand:
Continuation-Based Multiprocessing Revisited. High. Order Symb. Comput. 12(3): 283 (1999) - [j27]Mitchell Wand:
Continuation-Based Multiprocessing. High. Order Symb. Comput. 12(3): 285-299 (1999) - [c43]Steven E. Ganz, Daniel P. Friedman, Mitchell Wand:
Trampolined Style. ICFP 1999: 18-27 - [c42]Johan Ovlinger, Mitchell Wand:
A Language for Specifying Recursive Traversals of Object Structures. OOPSLA 1999: 70-81 - [c41]Mitchell Wand, Igor Siveroni:
Constraint Systems for Useless Variable Elimination. POPL 1999: 291-302 - 1998
- [j26]Mitchell Wand:
The Theory of Fexprs is Trivial. LISP Symb. Comput. 10(3): 189-199 (1998) - [j25]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): 7-105 (1998) - [c40]Mitchell Wand, William D. Clinger:
Set Constraints for Destructive Array Update Optimization. ICCL 1998: 184-195 - 1997
- [j24]Jens Palsberg, Mitchell Wand, Patrick O'Keefe:
Type Inference with Non-Structural Subtyping. Formal Aspects Comput. 9(1): 49-67 (1997) - [j23]Paul Steckler, Mitchell Wand:
Lightweight Closure Conversion. ACM Trans. Program. Lang. Syst. 19(1): 48-86 (1997) - [c39]Mitchell Wand, Gregory T. Sullivan:
Denotational Semantics Using an Operationally-Based Term Model. POPL 1997: 386-399 - 1996
- [c38]Jerzy Tiuryn, Mitchell Wand:
Untyped Lambda-Calculus with Input-Output. CAAP 1996: 317-329 - [c37]David S. Gladstein, Mitchell Wand:
Compiler Correctness for Concurrent Languages. COORDINATION 1996: 231-248 - [c36]Jonathan G. Rossie Jr., Daniel P. Friedman, Mitchell Wand:
Modeling Subobject-based Inheritance. ECOOP 1996: 248-274 - 1995
- [j22]Joshua D. Guttman, John D. Ramsdell, Mitchell Wand:
VLISP: A Verified Implementation of Scheme. LISP Symb. Comput. 8(1-2): 5-32 (1995) - [j21]Dino Oliva, John D. Ramsdell, Mitchell Wand:
The VLISP Verified PreScheme Compiler. LISP Symb. Comput. 8(1-2): 111-182 (1995) - [j20]Mitchell Wand, Patrick O'Keefe, Jens Palsberg:
Strong Normalization with Non-Structural Subtyping. Math. Struct. Comput. Sci. 5(3): 419-429 (1995) - [c35]Mitchell Wand:
Compiler Correctness for Parallel Languages. FPCA 1995: 120-134 - 1994
- [j19]Mitchell Wand, Zheng-Yu Wang:
Conditional Lambda-Theories and the Verification of Static Properties of Programs. Inf. Comput. 113(2): 253-277 (1994) - [c34]Mitchell Wand, Paul Steckler:
Selective and Lightweight Closure Conversion. POPL 1994: 435-445 - [c33]Paul Steckler, Mitchell Wand:
Selective Thunkification. SAS 1994: 162-178 - 1993
- [j18]Mitchell Wand:
Specifying the Correctness of Binding-Time Analysis. J. Funct. Program. 3(3): 365-387 (1993) - [c32]Mitchell Wand:
Specifying the Correctness of Binding-Time Analysis. POPL 1993: 137-143 - [c31]Jerzy Tiuryn, Mitchell Wand:
Type Reconstruction with Recursive Types and Atomic Subtyping. TAPSOFT 1993: 686-701 - 1992
- [b1]Daniel P. Friedman, Mitchell Wand, Christopher T. Haynes:
Essentials of programming languages. MIT Press 1992, ISBN 978-0-262-06145-2, pp. 1-536 - [c30]Patrick O'Keefe, Mitchell Wand:
Type Inference for Partial Types is Decidable. ESOP 1992: 408-417 - [c29]Mitchell Wand, Dino Oliva:
Proving the Correctness of Storage Representations. LISP and Functional Programming 1992: 151-160 - 1991
- [j17]Mitchell Wand:
Type Inference for Record Concatenation and Multiple Inheritance. Inf. Comput. 93(1): 1-15 (1991) - [j16]Margaret Montenyohl, Mitchell Wand:
Correctness of Static Flow Analysis in Continuation Semantics. Sci. Comput. Program. 16(1): 1-18 (1991) - [c28]Mitchell Wand, Patrick O'Keefe:
Automatic Dimensional Inference. Computational Logic - Essays in Honor of Alan Robinson 1991: 479-483 - [c27]Mitchell Wand:
Correctness of Procedure Representations in Higher-Order Assembly Language. MFPS 1991: 294-311 - 1990
- [j15]Mitchell Wand:
A Short Proof of the Lexical Addressing Algorithm. Inf. Process. Lett. 35(1): 1-5 (1990) - [c26]Mitchell Wand, Zheng-Yu Wang:
Conditional Lambda-Theories and the Verification of Static Properties of Programs. LICS 1990: 321-332
1980 – 1989
- 1989
- [j14]Margaret Montenyohl, Mitchell Wand:
Incorporating Static Analysis in a Combinator-Based Compiler. Inf. Comput. 82(2): 151-184 (1989) - [c25]Mitchell Wand, Patrick O'Keefe:
On the Complexity of Type Inference with Coercion. FPCA 1989: 293-298 - [c24]Mitchell Wand:
Type Inference for Record Concatenation and Multiple Inheritance. LICS 1989: 92-97 - 1988
- [j13]Mitchell Wand, Daniel P. Friedman:
The Mystery of the Tower Revealed: A Nonreflective Description of the Reflective Tower. LISP Symb. Comput. 1(1): 11-37 (1988) - [c23]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 - [c22]Mitchell Wand:
Corrigendum: Complete Type Inference for Simple Objects. LICS 1988: 132 - [c21]Margaret Montenyohl, Mitchell Wand:
Correct Flow Analysis in Continuation Semantics. POPL 1988: 204-218 - 1987
- [j12]Stefan Kölbl, Mitchell Wand:
Linear Future Semantics and Its Implementation. Sci. Comput. Program. 8(1): 87-103 (1987) - [c20]Mitchell Wand:
Complete Type Inference for Simple Objects. LICS 1987: 37-44 - [c19]Eugene E. Kohlbecker, Mitchell Wand:
Macro-by-Example: Deriving Syntactic Transformations from their Specifications. POPL 1987: 77-84 - 1986
- [j11]Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand:
Obtaining Coroutines with Continuations. Comput. Lang. 11(3/4): 143-153 (1986) - [c18]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 - [c17]Mitchell Wand:
Finding the Source of Type Errors. POPL 1986: 38-43 - 1985
- [c16]Albert R. Meyer, Mitchell Wand:
Continuation Semantics in Typed Lambda-Calculi (Summary). Logic of Programs 1985: 219-224 - [c15]Mitchell Wand:
From interpreter to compiler: a representational derivation. Programs as Data Objects 1985: 306-324 - [c14]Mitchell Wand:
Embedding Type Structure in Semantics. POPL 1985: 1-6 - 1984
- [c13]Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand:
Continuations and Coroutines. LISP and Functional Programming 1984: 293-298 - [c12]Daniel P. Friedman, Mitchell Wand:
Reification: Reflection without Metaphysics. LISP and Functional Programming 1984: 348-355 - [c11]Mitchell Wand:
A Types-as-Sets Semantics for Milner-Style Polymorphism. POPL 1984: 158-164 - [c10]Mitchell Wand:
A semantic prototyping system. SIGPLAN Symposium on Compiler Construction 1984: 213-221 - 1983
- [j10]Mitchell Wand:
Loops in Combinator-Based Compilers. Inf. Control. 57(2/3): 148-164 (1983) - [c9]Mitchell Wand:
Loops in Combinator-Based Compilers. POPL 1983: 190-196 - 1982
- [j9]Mitchell Wand:
Specifications, Models, and Implementations of Data Abstractions. Theor. Comput. Sci. 20: 3-32 (1982) - [j8]Mitchell Wand:
Deriving Target Code as a Representation of Continuation Semantics. ACM Trans. Program. Lang. Syst. 4(3): 496-517 (1982) - [c8]Mitchell Wand:
Semantics-Directed Machine Architecture. POPL 1982: 234-241 - 1980
- [j7]Mitchell Wand:
First-Order Identities as a Defining Language. Acta Informatica 14: 337-357 (1980) - [j6]Mitchell Wand:
Continuation-Based Program Transformation Strategies. J. ACM 27(1): 164-180 (1980) - [c7]Mitchell Wand:
Continuation-Based Multiprocessing. LISP Conference 1980: 19-28
1970 – 1979
- 1979
- [j5]Mitchell Wand:
Final Algebra Semantics and Data Type Extensions. J. Comput. Syst. Sci. 19(1): 27-44 (1979) - [j4]Mitchell Wand:
Fixed-Point Constructions in Order-Enriched Categories. Theor. Comput. Sci. 8: 13-30 (1979) - 1978
- [j3]Mitchell Wand, Daniel P. Friedman:
Compiling Lambda-Expressions Using Continuations and Factorizations. Comput. Lang. 3(4): 241-263 (1978) - [j2]Mitchell Wand:
A New Incompleteness Result for Hoare's System. J. ACM 25(1): 168-175 (1978) - 1977
- [j1]Mitchell Wand:
A Characterization of Weakest Preconditions. J. Comput. Syst. Sci. 15(2): 209-212 (1977) - 1976
- [c6]Daniel P. Friedman, David S. Wise, Mitchell Wand:
Recursive programming through table look-up. SYMSACC 1976: 85-89 - [c5]Mitchell Wand:
A New Incompleteness Result for Hoare's System. STOC 1976: 87-91 - 1974
- [c4]Mitchell Wand:
An algebraic formulation of the Chomsky hierarchy. Category Theory Applied to Computation and Control 1974: 209-213 - [c3]Mitchell Wand:
On the recursive specification of data types. Category Theory Applied to Computation and Control 1974: 214-217 - 1973
- [c2]Mitchell Wand:
An Unusual Application of Program-Proving. STOC 1973: 59-66 - 1972
- [c1]Mitchell Wand:
A Concrete Approach to Abstract Recursion Definitions. ICALP 1972: 331-341
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
