TinkerType: A language for playing with formal systems

Journal of Functional Programming

Volumn 13, Issue 2, 2003, Pages 295-316

  Levin, Michael Y ^a   Pierce, Benjamin C ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL SYSTEMS;

ALGORITHMS; COMPUTATION THEORY; SEMANTICS;

FORMAL LOGIC;

EID: 0037351353     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796802004550     Document Type: Article

References (33)

1. Abadi, M. and Cardelli, L. (1996) A Theory of Objects. Springer-Verlag.
2. Barendregt, H. P. (1992) Lambda calculi with types. In: Abramsky, S., Gabbay, Dov M. and Maibaum, T. S. E., editors, Handbook of Logic in Computer Science, vol. II. Oxford University Press.
3. Basin, D., Matthews, S. and Viganò, L. (1995) A modular presentation of modal logics in a logical framework, Proceedings of the Tbilisi Symposium on Language, Logic and Computation.
4. Berardi, S. (1988) Towards a mathematical analysis of the Coquand-Huet calculus of constructions and the other systems in Barendregt's cube. Technical report, Department of Computer Science, CMU, and Dipartimento Matematica, Universita di Torino.
5. Espinosa, D. (1995) Semantic Lego. PhD thesis, Columbia University.
6. Fiore, M., Plotkin, G. and Turi, D. (1999) Abstract syntax and variable binding (extended abstract). IEEE Symposium on Logic in Computer Science (LICS), pp. 193-202. IEEE Press.
7. Gapeyev, V., Levin, M. and Pierce, B. (2000) Recursive subtyping revealed. International Conference on Functional Programming (ICFP), Montreal, Canada.
8. Ghelli, G. (1990) Proof theoretic studies about a minimal type system integrating inclusion and parametric polymorphism. PhD thesis, Università di Pisa. (Technical report TD-6/90, Dipartimento di Informatica, Università di Pisa.)
9. Goguen, J. A. and Burstall, R. M. (1984) Introducing institutions. In: Clarke, E. and Kozen, D., editors, Logics of Programs: Workshop: Lecture Notes in Computer Science 164, pp. 221-256. Springer-Verlag.
10. Gunter, C. A. (1992) Semantics of Programming Languages: Structures and Techniques. MIT Press.
11. Harper, R., Honsell, F. and Plotkin, G. (1992) A framework for defining logics. J. ACM, 40(1), 143-184.
12. Harrison, W. and Ossher, H. (1993) Subject-oriented programming (a critique of pure objects). In: Paepcke, A., editor, ACM Symposium on Object Oriented Programming: Systems, Languages, and Applications (OOPSLA), pp. 411-428. (ACM SIGPLAN Notices, 28(10).) ACM Press.
13. Harrison, W. and Ossher, H. (1993) Subject-oriented programming (a critique of pure objects). In: Paepcke, A., editor, ACM Symposium on Object Oriented Programming: Systems, Languages, and Applications (OOPSLA), pp. 411-428. (ACM SIGPLAN Notices, 28(10).) ACM Press.
14. Harrison, W. L. and Kamin, S. N. (1998) Modular compilers based on monad transformers. Proceedings IEEE International Conference on Computer Languages.
15. Jacobs, B. (1999) Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics, no. 141. North Holland, Elsevier.
16. Kiczales, G. (1996) Aspect-oriented programming. ACM Comput. Surv. 28(4), 154.
17. Kiczales, G., Lamping, J., Mendhekar, A., Maeda, C., Lopes, C., Loingtier, J.-M. and Irwin, J. (1997) Aspect-oriented programming. European Conference on Object-Oriented Programming (ECOOP): Lecture Notes in Computer Science 1241. Springer-Verlag.
18. Landin, P. J. (1965) A correspondence between ALGOL 60 and Church's lambda-notation: Parts I and II. Comm. ACM, 8(2,3), 89-101, 158-165.
19. Landin, P. J. (1966) The next 700 programming languages. Comm. ACM, 9(3), 157-166.
20. Liang, S. and Hudak, P. (1996) Modular denotational semantics for compiler construction. Programming Languages and Systems (ESOP '96), Proc. 6th European Symposium on Programming: Lecture Notes in Computer Science 1058, pp. 219-234. Springer-Verlag.
21. Liang, S., Hudak, P. and Jones, M. (1995) Monad transformers and modular interpreters. ACM Symposium on Principles of Programming Languages (POPL), pp. 333-343. San Francisco, CA.
22. Mitchell, J. C. (1996) Foundations for Programming Languages. MIT Press.
23. Moggi, E. (1989) Computational lambda-calculus and monads. Fourth Annual Symposium on Logic in Computer Science, pp. 14-23. (Asilomar, CA). IEEE Press.
24. Mosses, P. D. (1992) Action semantics. Cambridge Tracts in Theoretical Computer Science, no. 26. Cambridge University Press.
25. Odersky, M., Sulzmann, M. and Wehr, M. (1999) Type inference with constrained types. Theory & Practice of Object Systems, 5(1), 35-55.
26. Ossher, H. and Tarr, P. (1999) Multi-dimensional separation of concerns in hyperspace. Technical Report RC 21452(96717)16APR99, IBM T. J. Watson Research Center.
27. Pfenning, F. and Elliott, C. (1988)) Higher-order abstract syntax, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 199-208. Atlanta, GA. (Available as Ergo Report 88-036, School of Computer Science, Carnegie Mellon University, Pittsburgh.)
28. Pierce, B. C. (1994) Bounded quantification is undecidable. Information & Computation, 112(1), 131-165. (Also in Gunter, C. A. and Mitchell, J. C., editors, Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, MIT Press, 1994.)
29. Pierce, B. C. (1994) Bounded quantification is undecidable. Information & Computation, 112(1), 131-165. (Also in Gunter, C. A. and Mitchell, J. C., editors, Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, MIT Press, 1994.)
30. Prehofer, C. (1997) Feature-oriented programming: A fresh look at objects. In: Aksit, M. and Matsuoka, S., editors, European Conference on Object-Oriented Programming (ECOOP): Lecture Notes in Computer Science 1241. Springer-Verlag.
31. Steele, Jr., G. L. (1994) Building interpreters by composing monads. ACM Symposium on Principles of Programming Languages (POPL), pp. 472-492. Portland, OR. ACM Press.
32. Tarr, P., Ossher, H. L., Harrison, W. H. and Sutton, Jr., S. M. (1999) N degrees of separation: Multi-dimentional separation of concerns. Proceedings of the 21st International Conference on Software Engineering.
33. Terlouw, J. (1989) Een nadere bewijstheoretische analyse van GSTTs. Manuscript, University of Nijmegen, Netherlands.