Mitchell Wand
#169,131
Most Influential Person Now
Mitchell Wand's AcademicInfluence.com Rankings
Mitchell Wandcomputer-science Degrees
Computer Science
#10314
World Rank
#10823
Historical Rank
Database
#7280
World Rank
#7535
Historical Rank
Download Badge
Computer Science
Why Is Mitchell Wand Influential?
(Suggest an Edit or Addition)Mitchell Wand's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Revised4 report on the algorithmic language scheme (1991) (703)
- Revised5 Report on the Algorithmic Language Scheme (1986) (697)
- Essentials of programming languages (2008) (367)
- A semantics for advice and dynamic join points in aspect-oriented programming (2001) (307)
- Complete Type Inference for Simple Objects (1987) (292)
- Type inference for record concatenation and multiple inheritance (1989) (222)
- Revised 5 Report on the Algorithmic Language (1999) (218)
- Final Algebra Semantics and Data Type Extensions (1979) (191)
- Continuation-Based Program Transformation Strategies (1980) (147)
- Finding the source of type errors (1986) (137)
- Reification: Reflection without metaphysics (1984) (131)
- The mystery of the tower revealed: a non-reflective description of the reflective tower (1986) (126)
- Deriving Target Code as a Representation of Continuation Semantics (1982) (120)
- Continuation Semantics in Typed Lambda-Calculi (Summary) (1985) (119)
- Small bisimulations for reasoning about higher-order imperative programs (2006) (117)
- Continuation-Based Multiprocessing (1980) (112)
- Obtaining Coroutines with Continuations (1986) (106)
- Fixed-Point Constructions in Order-Enriched Categories (1979) (104)
- The mystery of the tower revealed: A nonreflective description of the reflective tower (1988) (93)
- Continuations and coroutines (1984) (85)
- Trampolined style (1999) (85)
- Abstract continuations: a mathematical semantics for handling full jumps (1988) (81)
- Semantics-directed machine architecture (1982) (78)
- A semantic prototyping system (1984) (73)
- A New Incompleteness Result for Hoare's System (1978) (73)
- VLISP: A verified implementation of Scheme (1995) (72)
- Macro-by-example: Deriving syntactic transformations from their specifications (1987) (69)
- Lightweight closure conversion (1997) (65)
- Selective and lightweight closure conversion (1994) (59)
- Specifying the correctness of binding-time analysis (1993) (58)
- Correctness of Procedure Representations in Higher-Order Assembly Language (1991) (50)
- Constraint systems for useless variable elimination (1999) (49)
- A scheme for a higher-level semantic algebra (1986) (49)
- The Theory of Fexprs is Trivial (1998) (48)
- Corrigendum: complete type interference for simple objects (1988) (47)
- On the complexity of type inference with coercion (1989) (43)
- A Theory of Hygienic Macros (2008) (41)
- Automatic Dimensional Inference (1991) (41)
- An algebraic formulation of the Chomsky hierarchy (1974) (40)
- A separation logic for refining concurrent objects (2011) (39)
- A language for specifying recursive traversals of object structures (1999) (37)
- Bisimulations for Untyped Imperative Objects (2006) (37)
- Essentials of programming languages (2nd ed.) (2001) (37)
- Proving the correctness of storage representations (1992) (34)
- Reasoning About Class Behavior (2006) (34)
- Type inference for objects with instance variables and inheritance (1994) (33)
- Type Reconstruction with Recursive Types and Atomic Subtyping (1993) (33)
- Type Inference for Partial Types is Decidable (1992) (32)
- The VLISP verified PreScheme compiler (1995) (31)
- Compiler correctness for parallel languages (1995) (31)
- Set constraints for destructive array update optimization (1998) (30)
- Essentials of Programming Languages, 3rd Edition (2008) (28)
- Relating models of backtracking (2004) (27)
- Loops in combinator-based compilers (1983) (26)
- A Concrete Approach to Abstract Recursion Definitions (1972) (25)
- Contextual equivalence for a probabilistic language with continuous random variables and recursion (2018) (25)
- Recursive programming through table look-up (1976) (24)
- Modeling Subobject-based Inheritance (1996) (23)
- A Characterization of Weakest Preconditions (1977) (23)
- Parameterized Aspect Calculus: A Core Calculus for the Direct Study of Aspect-Oriented Languages (2003) (23)
- Specifications, Models, and Implementations of Data Abstractions (1982) (23)
- Understanding aspects: extended abstract (2003) (23)
- Type inference with non-structural subtyping (1995) (23)
- Compiling Lambda-Expressions Using Continuations and Factorizations (1978) (20)
- First-order identities as a defining language (1980) (19)
- From interpreter to compiler: a representational derivation (1985) (19)
- On the correctness of the Krivine machine (2007) (19)
- A types-as-sets semantics for milner-style polymorphism (1984) (18)
- Conditional lambda-theories and the verification of static properties of programs (1990) (17)
- Embedding type structure in semantics (1985) (17)
- Romeo: A system for more flexible binding-safe programming* (2014) (15)
- Compiler Correctness for Concurrent Languages (1996) (14)
- Selective Thunkification (1994) (14)
- CPS transformation of flow information (2003) (14)
- Denotational semantics using an operationally-based term model (1997) (13)
- Induction, recursion, and programming (1980) (13)
- Untyped Lambda-Calculus with Input-Output (1996) (13)
- On the recursive specification of data types (1974) (12)
- A Short Proof of the Lexical Addressing Algorithm (1990) (12)
- Correct flow analysis in continuation semantics (1988) (12)
- Parsing reflective grammars (2011) (11)
- Bottom-Up -Substitution: Uplinks and -DAGs (2004) (10)
- A Modular, Extensible Proof Method for Small-Step Flow Analyses (2002) (9)
- A Resource Analysis of the π-calculus (2011) (9)
- Bottom-up beta-reduction: Uplinks and lambda-DAGs (2005) (8)
- A new incompleteness result for Hoare's system (1976) (8)
- Reasoning about imperative and higher-order programs (2008) (8)
- A Compositional Trace Semantics for Orc (2008) (8)
- Essentials of programming languages (3. ed.) (2001) (7)
- Strong normalization with non-structural subtyping (1995) (7)
- What is LISP (1984) (7)
- Traversal Semantics in Object Graphs (2001) (7)
- Formal Definition of the Parameterized Aspect Calculus (2003) (7)
- Continuation-Based Multiprocessing Revisited (1999) (6)
- SIGPLAN programming language curriculum workshop: Discussion Summaries and recommendations (2008) (6)
- Selectors Make Set-Based Analysis Too Hard (2005) (6)
- Understanding and expressing scalable concurrency (2013) (6)
- A verified compiler for pure prescheme (1962) (6)
- Navigating through Object Graphs Using Local Meta-Information (2001) (5)
- Romeo (2014) (5)
- Boolean-valued loops (1975) (5)
- Inferring scope through syntactic sugar (2017) (5)
- Bottom-Up beta-Substitution: Uplinks and lambda-DAGs (2004) (5)
- Bottom-Up β-Reduction: Uplinks and λ-DAGs (2005) (4)
- An Empirical Study of the Demeter System (2004) (4)
- Incorporating Static Analysis in a Combinator-Based Compiler (1989) (3)
- An unusual application of program-proving (1973) (3)
- Correctness of Static Flow Analysis in Continuation Semantics (1991) (3)
- A resource analysis of the pi-calculus (2011) (3)
- The Higher-Order Aggregate Update Problem (2008) (3)
- An Extensional Metalanguage with I/o and a Dynamic Store (extended Abstract) (1995) (3)
- Programming languages: fundamental concepts for expanding and disciplining the mind (2008) (1)
- Free, iteratively closed categories of complete lattices (1975) (1)
- Finite-depth higher-order abstract syntax trees for reasoning about probabilistic programs ∗ Extended (2015) (1)
- Analysis-based program transformations (2000) (0)
- Linear Future Semantics and Its Implementation (1987) (0)
- A separation logic for the -calculus (2009) (0)
- Bottom-up å-reduction: uplinks and ï-DAGs É (extended version) (2004) (0)
- Inferring Scope through Syntactic Sugar ( Extended Version ) (2017) (0)
- Coq proofs for (2018) (0)
- Hygienic macro technology (2020) (0)
- Theories, Pre-Theories and Finite State Transformations on Trees (1971) (0)
- Evolution of Software via Adaptive Programming Arpa Grant Proposal (1995) (0)
- Review: Robert Goldblatt, Axiomatising the Logic of Computer Programming (1985) (0)
- Bottom-up fl-reduction: uplinks and ‚-DAGs (journal version) (2010) (0)
- Optimizing memory usage in higher-order programming languages: theoretical and experimental studies (2000) (0)
- Session details: Invited talk (2009) (0)
- {16 () Continuation-based Multiprocessing * (1980) (0)
- Selective Thunkiication (2007) (0)
- John Cage: Variations VII (2008) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Mitchell Wand?
Mitchell Wand is affiliated with the following schools:
