עקוב אחר
Mitchell Wand
Mitchell Wand
Professor of Computer Science, Northeastern University
כתובת אימייל מאומתת בדומיין ccs.neu.edu
כותרת
צוטט על ידי
צוטט על ידי
שנה
Revised5 Report on the Algorithmic Language Scheme
H Abelson, RK Dybvig, CT Haynes, GJ Rozas, NI Adams, DP Friedman, ...
Higher-order and symbolic computation 11, 7-105, 1998
1040*1998
Essentials of programming languages
DP Friedman, M Wand, CT Haynes
MIT press, 2001
5812001
Type inference for simple objects
M Wand
Proc., IEEE Symposium on Logic in Computer Science, 37-44, 1987
3531987
A semantics for advice and dynamic join points in aspect-oriented programming
M Wand, G Kiczales, C Dutchyn
ACM Transactions on Programming Languages and Systems (TOPLAS) 26 (5), 890-910, 2004
3182004
Type inference for record concatenation and multiple inheritance
M Wand
Information and Computation 93 (1), 1-15, 1991
2961991
Continuation-based multiprocessing
M Wand
Proceedings of the 1980 ACM Conference on LISP and Functional Programming, 19-28, 1980
2351980
Final algebra semantics and data type extensions
M Wand
Journal of Computer and System Sciences 19 (1), 27-44, 1979
2281979
The mystery of the tower revealed: A non-reflective description of the reflective tower
M Wand, DP Friedman
Proceedings of the 1986 ACM Conference on LISP and Functional Programming …, 1986
2101986
A simple algorithm and proof for type inference
M Wand
Fundamenta Informaticae 10 (2), 115-121, 1987
2011987
Reification: Reflection without metaphysics
DP Friedman, M Wand
Proceedings of the 1984 ACM Symposium on LISP and functional programming …, 1984
1991984
Continuation-based program transformation strategies
M Wand
Journal of the ACM (JACM) 27 (1), 164-180, 1980
1991980
Finding the source of type errors
M Wand
Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of …, 1986
1831986
Deriving target code as a representation of continuation semantics
M Wand
ACM Transactions on Programming Languages and Systems (TOPLAS) 4 (3), 496-517, 1982
1701982
Continuation semantics in typed lambda-calculi: Summary
AR Meyer, M Wand
Logics of Programs: Brooklyn, June 17–19, 1985 Proceedings, 219-224, 1985
1661985
Obtaining coroutines with continuations
CT Haynes, DP Friedman, M Wand
Computer languages 11 (3-4), 143-153, 1986
1411986
Small bisimulations for reasoning about higher-order imperative programs
V Koutavas, M Wand
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of …, 2006
1402006
Continuations and coroutines
CT Haynes, DP Friedman, M Wand
Proceedings of the 1984 ACM Symposium on LISP and functional programming …, 1984
1401984
Trampolined style
SE Ganz, DP Friedman, M Wand
Proceedings of the fourth ACM SIGPLAN international conference on Functional …, 1999
1211999
Fixed-point constructions in order-enriched categories
M Wand
Theoretical Computer Science 8 (1), 13-30, 1979
1091979
A new incompleteness result for Hoare's system
M Wand
Journal of the ACM (JACM) 25 (1), 168-175, 1978
1041978
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–20