Mitchell Wand - RankMe

106 papers A* 20A 12B 4C 2Journal 45Unranked 20

Year	Rank	Type	Title / Venue / Authors
2020	J	`jnl`	Hygienic macro technology. Proc. ACM Program. Lang. William D. Clinger, Mitchell Wand
2018	J	`jnl`	Contextual Equivalence for a Probabilistic Language with Continuous Random Variables and Recursion. CoRR Mitchell Wand, Ryan Culpepper, Theophilos Giannakopoulos, Andrew Cobb
2018	J	`jnl`	Contextual equivalence for a probabilistic language with continuous random variables and recursion. Proc. ACM Program. Lang. Mitchell Wand, Ryan Culpepper, Theophilos Giannakopoulos, Andrew Cobb
2017	J	`jnl`	Inferring scope through syntactic sugar. Proc. ACM Program. Lang. Justin Pombrio, Shriram Krishnamurthi, Mitchell Wand
2016	J	`jnl`	Romeo: A system for more flexible binding-safe programming. J. Funct. Program. Paul Stansifer, Mitchell Wand
2014	A	`conf`	Romeo: a system for more flexible binding-safe programming. ICFP Paul Stansifer, Mitchell Wand
2011	B	`conf`	A Resource Analysis of the π-calculus. MFPS Aaron Joseph Turon, Mitchell Wand
2011	J	`jnl`	A resource analysis of the pi-calculus CoRR Aaron Joseph Turon, Mitchell Wand
2011	A*	`conf`	A separation logic for refining concurrent objects. POPL Aaron Joseph Turon, Mitchell Wand
2011	J	`jnl`	Parsing Reflective Grammars CoRR Paul Stansifer, Mitchell Wand
2011	—	`conf`	Parsing reflective grammars. LDTA Paul Stansifer, Mitchell Wand
2010	J	`jnl`	Bottom-up beta-reduction: Uplinks and lambda-DAGs. Fundam. Informaticae Olin Shivers, Mitchell Wand
2009	B	`conf`	The Higher-Order Aggregate Update Problem. VMCAI Christos Dimoulas, Mitchell Wand
2008	C	`conf`	A Compositional Trace Semantics for Orc. COORDINATION Dimitrios Vardoulakis, Mitchell Wand
2008	A	`conf`	A Theory of Hygienic Macros. ESOP David Herman, Mitchell Wand
2008	—	`book`	Essentials of programming languages (3. ed.). Daniel P. Friedman, Mitchell Wand
2008	J	`jnl`	Programming languages: fundamental concepts for expanding and disciplining the mind. ACM SIGPLAN Notices Mitchell Wand, Daniel P. Friedman
2008	J	`jnl`	SIGPLAN programming language curriculum workshop: Discussion Summaries and recommendations. ACM SIGPLAN Notices 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
2007	J	`jnl`	On the correctness of the Krivine machine. High. Order Symb. Comput. Mitchell Wand
2006	A	`conf`	Bisimulations for Untyped Imperative Objects. ESOP Vasileios Koutavas, Mitchell Wand
2006	A*	`conf`	Small bisimulations for reasoning about higher-order imperative programs. POPL Vasileios Koutavas, Mitchell Wand
2005	A	`conf`	Bottom-Up beta-Reduction: Uplinks and lambda-DAGs. ESOP Olin Shivers, Mitchell Wand
2005	J	`jnl`	Selectors Make Set-Based Analysis Too Hard. High. Order Symb. Comput. Philippe Meunier, Robert Bruce Findler, Paul Steckler, Mitchell Wand
2004	J	`jnl`	A semantics for advice and dynamic join points in aspect-oriented programming. ACM Trans. Program. Lang. Syst. Mitchell Wand, Gregor Kiczales, Christopher Dutchyn
2004	A	`conf`	Relating models of backtracking. ICFP Mitchell Wand, Dale Vaillancourt
2003	J	`jnl`	CPS transformation of flow information. J. Funct. Program. Jens Palsberg, Mitchell Wand
2003	A	`conf`	Understanding aspects: extended abstract. ICFP Mitchell Wand
2002	A	`conf`	A Modular, Extensible Proof Method for Small-Step Flow Analyses. ESOP Mitchell Wand, Galen B. Williamson
2002	A	`ed.`	Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), Pittsburgh, Pennsylvania, USA, October 4-6, 2002. ICFP Mitchell Wand, Simon L. Peyton Jones
2001	—	`conf`	A Semantics for Advice and Dynamic Join Points in Aspect-Oriented Programming. SAIG Mitchell Wand
2001	—	`book`	Essentials of programming languages (2. ed.). Daniel P. Friedman, Mitchell Wand, Christopher T. Haynes
2001	J	`jnl`	Set constraints for destructive array update optimization. J. Funct. Program. Mitchell Wand, William D. Clinger
2000	J	`jnl`	Analysis-based program transformations. ACM SIGSOFT Softw. Eng. Notes Mitchell Wand
2000	J	`jnl`	Optimizing memory usage in higher-order programming languages: theoretical and experimental studies. ACM SIGSOFT Softw. Eng. Notes Mitchell Wand, William D. Clinger
1999	A	`conf`	A Language for Specifying Recursive Traversals of Object Structures. OOPSLA Johan Ovlinger, Mitchell Wand
1999	A*	`conf`	Constraint Systems for Useless Variable Elimination. POPL Mitchell Wand, Igor Siveroni
1999	J	`jnl`	Continuation-Based Multiprocessing Revisited. High. Order Symb. Comput. Mitchell Wand
1999	J	`jnl`	Continuation-Based Multiprocessing. High. Order Symb. Comput. Mitchell Wand
1999	A	`conf`	Trampolined Style. ICFP Steven E. Ganz, Daniel P. Friedman, Mitchell Wand
1998	J	`jnl`	Revised Report on the Algorithmic Language Scheme. High. Order Symb. Comput. 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
1998	—	`conf`	Set Constraints for Destructive Array Update Optimization. ICCL Mitchell Wand, William D. Clinger
1998	J	`jnl`	The Theory of Fexprs is Trivial. LISP Symb. Comput. Mitchell Wand
1997	A*	`conf`	Denotational Semantics Using an Operationally-Based Term Model. POPL Mitchell Wand, Gregory T. Sullivan
1997	J	`jnl`	Lightweight Closure Conversion. ACM Trans. Program. Lang. Syst. Paul Steckler, Mitchell Wand
1997	J	`jnl`	Type Inference with Non-Structural Subtyping. Formal Aspects Comput. Jens Palsberg, Mitchell Wand, Patrick O'Keefe
1996	C	`conf`	Compiler Correctness for Concurrent Languages. COORDINATION David S. Gladstein, Mitchell Wand
1996	A	`conf`	Modeling Subobject-based Inheritance. ECOOP Jonathan G. Rossie Jr., Daniel P. Friedman, Mitchell Wand
1996	—	`conf`	Untyped Lambda-Calculus with Input-Output. CAAP Jerzy Tiuryn, Mitchell Wand
1995	—	`conf`	Compiler Correctness for Parallel Languages. FPCA Mitchell Wand
1995	J	`jnl`	Strong Normalization with Non-Structural Subtyping. Math. Struct. Comput. Sci. Mitchell Wand, Patrick O'Keefe, Jens Palsberg
1995	J	`jnl`	The VLISP Verified PreScheme Compiler. LISP Symb. Comput. Dino Oliva, John D. Ramsdell, Mitchell Wand
1995	J	`jnl`	VLISP: A Verified Implementation of Scheme. LISP Symb. Comput. Joshua D. Guttman, John D. Ramsdell, Mitchell Wand
1994	J	`jnl`	Conditional Lambda-Theories and the Verification of Static Properties of Programs Inf. Comput. Mitchell Wand, Zheng-Yu Wang
1994	B	`conf`	Selective Thunkification. SAS Paul Steckler, Mitchell Wand
1994	A*	`conf`	Selective and Lightweight Closure Conversion. POPL Mitchell Wand, Paul Steckler
1993	A*	`conf`	Specifying the Correctness of Binding-Time Analysis. POPL Mitchell Wand
1993	J	`jnl`	Specifying the Correctness of Binding-Time Analysis. J. Funct. Program. Mitchell Wand
1993	—	`conf`	Type Reconstruction with Recursive Types and Atomic Subtyping. TAPSOFT Jerzy Tiuryn, Mitchell Wand
1992	—	`book`	Essentials of programming languages. Daniel P. Friedman, Mitchell Wand, Christopher T. Haynes
1992	—	`conf`	Proving the Correctness of Storage Representations. LISP and Functional Programming Mitchell Wand, Dino Oliva
1992	A	`conf`	Type Inference for Partial Types is Decidable. ESOP Patrick O'Keefe, Mitchell Wand
1991	—	`conf`	Automatic Dimensional Inference. Computational Logic - Essays in Honor of Alan Robinson Mitchell Wand, Patrick O'Keefe
1991	B	`conf`	Correctness of Procedure Representations in Higher-Order Assembly Language. MFPS Mitchell Wand
1991	J	`jnl`	Correctness of Static Flow Analysis in Continuation Semantics. Sci. Comput. Program. Margaret Montenyohl, Mitchell Wand
1991	J	`jnl`	Type Inference for Record Concatenation and Multiple Inheritance Inf. Comput. Mitchell Wand
1990	J	`jnl`	A Short Proof of the Lexical Addressing Algorithm. Inf. Process. Lett. Mitchell Wand
1990	A*	`conf`	Conditional Lambda-Theories and the Verification of Static Properties of Programs LICS Mitchell Wand, Zheng-Yu Wang
1989	J	`jnl`	Incorporating Static Analysis in a Combinator-Based Compiler Inf. Comput. Margaret Montenyohl, Mitchell Wand
1989	—	`conf`	On the Complexity of Type Inference with Coercion. FPCA Mitchell Wand, Patrick O'Keefe
1989	A*	`conf`	Type Inference for Record Concatenation and Multiple Inheritance LICS Mitchell Wand
1988	—	`conf`	Abstract Continuations: A Mathematical Semantics for Handling Full Jumps. LISP and Functional Programming Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, Bruce F. Duba
1988	A*	`conf`	Correct Flow Analysis in Continuation Semantics. POPL Margaret Montenyohl, Mitchell Wand
1988	A*	`conf`	Corrigendum: Complete Type Inference for Simple Objects LICS Mitchell Wand
1988	J	`jnl`	The Mystery of the Tower Revealed: A Nonreflective Description of the Reflective Tower. LISP Symb. Comput. Mitchell Wand, Daniel P. Friedman
1987	A*	`conf`	Complete Type Inference for Simple Objects LICS Mitchell Wand
1987	J	`jnl`	Linear Future Semantics and Its Implementation. Sci. Comput. Program. Stefan Kölbl, Mitchell Wand
1987	A*	`conf`	Macro-by-Example: Deriving Syntactic Transformations from their Specifications. POPL Eugene E. Kohlbecker, Mitchell Wand
1986	A*	`conf`	Finding the Source of Type Errors. POPL Mitchell Wand
1986	J	`jnl`	Obtaining Coroutines with Continuations. Comput. Lang. Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand
1986	—	`conf`	The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower. LISP and Functional Programming Mitchell Wand, Daniel P. Friedman
1985	—	`conf`	Continuation Semantics in Typed Lambda-Calculi (Summary). Logic of Programs Albert R. Meyer, Mitchell Wand
1985	A*	`conf`	Embedding Type Structure in Semantics. POPL Mitchell Wand
1985	—	`conf`	From interpreter to compiler: a representational derivation. Programs as Data Objects Mitchell Wand
1984	A*	`conf`	A Types-as-Sets Semantics for Milner-Style Polymorphism. POPL Mitchell Wand
1984	—	`conf`	A semantic prototyping system. SIGPLAN Symposium on Compiler Construction Mitchell Wand
1984	—	`conf`	Continuations and Coroutines. LISP and Functional Programming Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand
1984	—	`conf`	Reification: Reflection without Metaphysics. LISP and Functional Programming Daniel P. Friedman, Mitchell Wand
1983	J	`jnl`	Loops in Combinator-Based Compilers Inf. Control. Mitchell Wand
1983	A*	`conf`	Loops in Combinator-Based Compilers. POPL Mitchell Wand
1982	J	`jnl`	Deriving Target Code as a Representation of Continuation Semantics. ACM Trans. Program. Lang. Syst. Mitchell Wand
1982	A*	`conf`	Semantics-Directed Machine Architecture. POPL Mitchell Wand
1982	J	`jnl`	Specifications, Models, and Implementations of Data Abstractions. Theor. Comput. Sci. Mitchell Wand
1980	—	`conf`	Continuation-Based Multiprocessing. LISP Conference Mitchell Wand
1980	J	`jnl`	Continuation-Based Program Transformation Strategies. J. ACM Mitchell Wand
1980	J	`jnl`	First-Order Identities as a Defining Language. Acta Informatica Mitchell Wand
1979	J	`jnl`	Final Algebra Semantics and Data Type Extensions. J. Comput. Syst. Sci. Mitchell Wand
1979	J	`jnl`	Fixed-Point Constructions in Order-Enriched Categories. Theor. Comput. Sci. Mitchell Wand
1978	J	`jnl`	A New Incompleteness Result for Hoare's System. J. ACM Mitchell Wand
1978	J	`jnl`	Compiling Lambda-Expressions Using Continuations and Factorizations. Comput. Lang. Mitchell Wand, Daniel P. Friedman
1977	J	`jnl`	A Characterization of Weakest Preconditions. J. Comput. Syst. Sci. Mitchell Wand
1976	A*	`conf`	A New Incompleteness Result for Hoare's System STOC Mitchell Wand
1976	—	`conf`	Recursive programming through table look-up. SYMSACC Daniel P. Friedman, David S. Wise, Mitchell Wand
1974	—	`conf`	An algebraic formulation of the Chomsky hierarchy. Category Theory Applied to Computation and Control Mitchell Wand
1974	—	`conf`	On the recursive specification of data types. Category Theory Applied to Computation and Control Mitchell Wand
1973	A*	`conf`	An Unusual Application of Program-Proving STOC Mitchell Wand
1972	A*	`conf`	A Concrete Approach to Abstract Recursion Definitions. ICALP Mitchell Wand