Mitchell Wand

From MaRDI portal
Person:808686

Available identifiers

zbMath Open wand.mitchellMaRDI QIDQ808686

List of research outcomes





PublicationDate of PublicationType
Correctness of procedure representations in higher-order assembly language2023-08-16Paper
Untyped lambda-calculus with input-output2023-02-23Paper
Type reconstruction with recursive types and atomic subtyping2022-11-02Paper
Romeo: A system for more flexible binding-safe programming2017-10-23Paper
Small bisimulations for reasoning about higher-order imperative programs2017-08-21Paper
Romeo: a system for more flexible binding-safe programming2016-09-29Paper
Trampolined style2016-09-01Paper
A Resource Analysis of the π-calculus2016-07-15Paper
Relating models of backtracking2015-03-09Paper
A separation logic for refining concurrent objects2014-04-10Paper
Bottom-up β-reduction: Uplinks and λ-DAGs2011-05-18Paper
https://portal.mardi4nfdi.de/entity/Q36517342009-12-11Paper
The Higher-Order Aggregate Update Problem2009-02-10Paper
A Theory of Hygienic Macros2008-04-11Paper
On the correctness of the Krivine machine2007-12-17Paper
Programming Languages and Systems2007-05-02Paper
Selectors make set-based analysis too hard2006-01-23Paper
Programming Languages and Systems2005-09-13Paper
https://portal.mardi4nfdi.de/entity/Q47383582004-08-11Paper
CPS transformation of flow information2004-03-29Paper
https://portal.mardi4nfdi.de/entity/Q44457662004-02-02Paper
Essentials of programming languages.2001-09-11Paper
Set constraints for destructive array update optimization2001-07-23Paper
Type inference with non-structural subtyping1997-08-03Paper
Strong normalization with non-structural subtyping1996-07-01Paper
Conditional lambda-theories and the verification of static properties of programs1994-09-13Paper
https://portal.mardi4nfdi.de/entity/Q40240071993-01-23Paper
Type inference for record concatenation and multiple inheritance1991-01-01Paper
Correctness of static flow analysis in continuation semantics1991-01-01Paper
A short proof of the lexical addressing algorithm1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32040261989-01-01Paper
Incorporating static analysis in a combinator-based compiler1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37879791987-01-01Paper
Linear future semantics and its implementation1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37749871986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36802631985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37501081985-01-01Paper
What is Lisp1984-01-01Paper
Loops in combinator-based compilers1983-01-01Paper
Specifications, models, and implementations of data abstractions1982-01-01Paper
Deriving Target Code as a Representation of Continuation Semantics1982-01-01Paper
First-order identities as a defining language1980-01-01Paper
Continuation-Based Program Transformation Strategies1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38671451980-01-01Paper
Final algebra semantics and data type extensions1979-01-01Paper
Fixed-point constructions in order-enriched categories1979-01-01Paper
A New Incompleteness Result for Hoare's System1978-01-01Paper
Compiling lambda-expressions using continuations and factorizations1978-01-01Paper
A characterization of weakest preconditions1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41403501976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41041201976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40619861975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40619421975-01-01Paper
Boolean-valued loops1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44044571973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40943601973-01-01Paper

Research outcomes over time

This page was built for person: Mitchell Wand