What is he best known for?
The fields of study he is best known for:
- Programming language
- Functional programming
- Algebra
Mitchell Wand mainly focuses on Programming language, Algorithm, Continuation, Type and Theoretical computer science.
In his articles, he combines various disciplines, including Programming language and First class.
His work carried out in the field of Algorithm brings together such families of science as Simple, Inference, Calculus and Inductive logic programming.
His work in Theoretical computer science covers topics such as Set which are related to areas like Lambda calculus.
The concepts of his Fifth-generation programming language study are interwoven with issues in Fourth-generation programming language and Very high-level programming language.
Mitchell Wand interconnects Continuation-passing style, High-level programming language and Programming language specification in the investigation of issues within First-generation programming language.
His most cited work include:
- Revised Report on the Algorithmic Language Scheme (437 citations)
- Revised4 report on the algorithmic language scheme (367 citations)
- Revised3 report on the algorithmic language scheme (290 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Programming language, Theoretical computer science, Algorithm, Correctness and Compiler.
His work is connected to Semantics, Operational semantics, Scheme, Denotational semantics and Fifth-generation programming language, as a part of Programming language.
His work in Fifth-generation programming language addresses issues such as Very high-level programming language, which are connected to fields such as Fourth-generation programming language.
The Theoretical computer science study combines topics in areas such as Java, Combinatory logic, Data structure and Continuation.
His Algorithm study integrates concerns from other disciplines, such as Transformation, Set and Combinatorial explosion.
His research on Correctness also deals with topics like
- Equivalence and Type inference most often made with reference to Lambda calculus,
- Soundness most often made with reference to Mathematical proof.
He most often published in these fields:
- Programming language (54.26%)
- Theoretical computer science (27.91%)
- Algorithm (18.60%)
What were the highlights of his more recent work (between 2004-2020)?
- Programming language (54.26%)
- Equivalence (7.75%)
- Lambda calculus (12.40%)
In recent papers he was focusing on the following fields of study:
His primary scientific interests are in Programming language, Equivalence, Lambda calculus, Algorithm and Theoretical computer science.
His studies in Syntax, Second-generation programming language, Fifth-generation programming language, Comparison of multi-paradigm programming languages and Programming language theory are all subfields of Programming language research.
His biological study spans a wide range of topics, including First-generation programming language, Symbolic programming and Very high-level programming language.
Within one scientific family, he focuses on topics pertaining to Bisimulation under Equivalence, and may sometimes address concerns connected to Calculus, Ambiguity, Denotational semantics and Denotational semantics of the Actor model.
His Algorithm research is multidisciplinary, incorporating perspectives in Functional programming, Computational intelligence, Symbolic computation and Data structure.
His Theoretical computer science research is multidisciplinary, relying on both Java and Bunched logic.
Between 2004 and 2020, his most popular works were:
- Essentials of Programming Languages (251 citations)
- Small bisimulations for reasoning about higher-order imperative programs (101 citations)
- Bisimulations for untyped imperative objects (35 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Functional programming
- Algebra
The scientist’s investigation covers issues in Programming language, Equivalence, Algorithm, Comparison of multi-paradigm programming languages and Third-generation programming language.
His study in Scheme, Semantics, Syntax, Data structure and Formal verification falls within the category of Programming language.
His Semantics research includes themes of Variable and Executable.
His research in Equivalence intersects with topics in Functional programming, Theoretical computer science, Bisimulation, Conservative extension and Calculus.
His study explores the link between Algorithm and topics such as Lambda calculus that cross with problems in Computational intelligence, Correctness, Reduction, Head and Symbolic computation.
His research investigates the connection between Comparison of multi-paradigm programming languages and topics such as Fourth-generation programming language that intersect with issues in Very high-level programming language, Programming language theory, Declarative programming and Compiled language.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
