Shail Aditya
- 1.Andrew W. Appel. Runtime Tags Aren't Necessary. Lisp and Symbolic Computation, 2:153-162, 1989.Google Scholar
Cross Ref
- 2.Alejandro Caro. A Debugger for Id. Master's thesis, Massachusetts Institute of Technology, February 1993.Google Scholar
- 3.L. Damns and R. Milner. Principle Type Schemes for Functional Programs. In Proceedings of the 9th A CM Symposium on Principles of Programming Languages, pages 207-212, 1982. Google ScholarDigital Library
- 4.Benjamin Goldberg. Tag-Free Garbage Collection for Strongly Typed Programming Languages. in Proceedings of the A CM SIGPLAN '91 Conference on Programming Language Design and Implementation, Toronto, Ontario, Canada, pages 165-176, June 1991. Google ScholarDigital Library
- 5.Benjamin Goldberg and Michael Gloger. Polymorphic Type Reconstruction for Garbage Collection without Tags. In Proceedings of the A CM Conference on Lisp and Functional Programming, pages 53-65, 1992. Google ScholarDigital Library
- 6.Shail Aditya Gupta. An Incremental Type inference System for the Programming Language id. Master's thesis, MIT, Laboratory for Computer Science, September 1990. Available as Technical Report MIT/LCS/TR- 488. Google ScholarDigital Library
- 7.P. Hudak ~nd P. Wadler (editors). Report on the programming language Haskell, a non-strict purely functional language (Version 1.0). Technical Report YALEU/DCS/RR777, Yale University, Department of Computer Science, April 1990.Google Scholar
- 8.Robin Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences, 17:348-375, 1978.Google ScholarCross Ref
- 9.Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard NIL. The MIT Press, Cambridge, Massachusetts, 1990. Google ScholarDigital Library
- 10.Rishiyur S. Nikhil. Id Language Reference Manual Version 90.1. Technical Report CSG Memo 284-2, MIT Laboratory for Computer Science, 545 TechnoL ogy Square, Cambridge, MA 02139, July 15 1991.Google Scholar
- 11.Mads Torte. Operational Semantics and Polymorphic Type Inference. PhD thesis, University of Edinburgh, Department of Computer Science, 1988. Also published as ECS-LFCS-88-54.Google Scholar
- 12.Kenneth R. Traub, Gregory M. Papadopoulos, Michael J. Be&erie, James E. Hicks, and Jonathan Young. Overview of the Monsoon Project. In Proceedings of the 1991 IEEE International Conference on Computer Design: VLSi in Computers and Processors, pages 150-155, October 1991. Also published as CSG Memo 338, MIT and Motorola Technical Report MCRC-TR 15. Google ScholarDigital Library
- 13.Philip Wadler and Stephen Blott. How to make adhoc polymorphism less ad hoc. in Proceedings of the 16th ACM Symposium on Principles of Programming Languages, Austin, Texas, pages 60-76, January 1989. Google ScholarDigital Library
Index Terms
- Compiler-directed type reconstruction for polymorphic languages
Recommendations
Polymorphic algebraic data type reconstruction
PPDP '06: Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programmingOne of the disadvantages of statically typed languages is the programming overhead caused by writing all the necessary type information: Both type declarations and type definitions are typically required. Traditional type inference aims at relieving the ...
Type reconstruction with first-class polymorphic values
Proceedings of the SIGPLAN '89 symposium on Interpreters and interpretive techniquesWe present the first type reconstruction system which combines the implicit typing of ML with the full power of the explicitly typed second-order polymorphic lambda calculus. The system will accept ML-style programs, explicitly typed programs, and ...
Comments