Algebraic reconstruction of types and effects

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algebraic reconstruction of types and effects

Full text

Pdf (775 KB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Orlando, Florida, United States

Pages: 303 - 310

Year of Publication: 1991

ISBN:0-89791-419-8

Authors

Pierre Jouvelot	Ecole des Mines de Paris and MIT Laboratory for Computer Science
David Gifford	MIT Laboratory for Computer Science

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 52, Citation Count: 37

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/99583.99623 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	B85	Boehm, H. J. Partial Polymorphic Type Inference is Undecidable. In Proceedings of the P6th FOCS Symposium. IEEE, 1985.
	C84	Luca Cardelli, A semantics of multiple inheritance., Proc. of the international symposium on Semantics of data types, p.51-67, July 1984, Sophia-Antipolis, France
	DG84	Dowling, W. F., and Gallier, J. H. Linear-time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. Logic Programming (3), 1984.
	DM82	Luis Damas , Robin Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-212, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582176]
	FLO83	Steven Fortune , Daniel Leivant , Michael O'Donnell, The Expressiveness of Simple and Second-Order Type Structures, Journal of the ACM (JACM), v.30 n.1, p.151-185, Jan. 1983 [doi>10.1145/322358.322370]
	GJLS87	Gifford, D. K., Jouvelot, P., Lucassen, J. M., and Sheldon, M. A. The FX-87 Reference Manual. Massachusetts Institute of Technology, LCS/TR-407, 1987.
	GR88	Giannini, P., and Ronchi Della Rocca, S. Characterization of Typings in Polymorphic Type Discipline. In Proceedings of the IEEE LICS Symposium. IEEE, 1988.
	HG88	R. T. Hammel , D. K. Gifford, FX-87 PERFORMANCE MEASUREMENTS: DATAFLOW IMPLEMENTATION, Massachusetts Institute of Technology, Cambridge, MA, 1988
	J89	L. Jategaonkar, ML WITH EXTENDED PATTERN MATCHING AND SUBTYPES, Massachusetts Institute of Technology, Cambridge, MA, 1989
	JG89a	Jouvelot, P., and Gifford, D. K. Communication Effects for Message-Based Concurrency. Massachusetts Institute of Technology, LCS/TM-386, February 1989.
	JG89b	P. Jouvelot , D. K. Gifford, Reasoning about continuations with control effects, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.218-226, June 19-23, 1989, Portland, Oregon, United States
	KN86	D Kapur , P Narendran, NP-completeness of the set unification and matching problems, Proc. of the 8th international conference on Automated deduction, p.489-495, August 1986, Oxford, United Kingdom
	LC89	Patrick Lincoln , Jim Christian, Adventures in associative-communtative unification, Journal of Symbolic Computation, v.8 n.1-2, p.217-240, Jul./Aug. 1989 [doi>10.1016/S0747-7171(89)80026-4]
	LG88	J. M. Lucassen , D. K. Gifford, Polymorphic effect systems, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.47-57, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73564]
	M68	Morris, J. H. Lambda-Calculus Models of Programming Languages, Massachusetts Institute of Technology, MAC-TR-57, 1968.
	M78	Milner, R. A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences, vol. 17, 1978, pp. 349-375.
	M89	Mitchell, J. Type Systems for Programming Languages. Stanford Rep. CS-89-1277, 1989.
	M90	Harry G. Mairson, Deciding ML typability is complete for deterministic exponential time, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.382-401, December 1989, San Francisco, California, United States [doi>10.1145/96709.96748]
	MB90	McAllester, D., and Blair, M. Private communication. July 1990.
	OG89	O'Toole, J., and Gifford, D. K. Polymorphic Type Reconstruction. In Proceedings of the A CM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 1989.
	P88	Frank Pfenning, Partial polymorphic type inference and higher-order unification, Proceedings of the 1988 ACM conference on LISP and functional programming, p.153-163, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62697]
	R65	J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965 [doi>10.1145/321250.321253]
	T87	Torte, M. Operational Semantics and Polymorphic Type Inference. Ph.D. Thesis, Edinburgh University, 1987.
	W87	Wand, M. Complete Type Inference for Simple Objects, in Proceedings of the 1EEE LICS Symposium. IEEE, 1987.
	W88	Wand, M. Corrigendum: Complete Type Inference for Simple Objects. In Proceedings of the 1EEE LIGS Symposium. IEEE, 1988.
	W89	M. Wand, Type inference for record concatenatiOn and multiple inheritance, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.92-97, June 1989, Pacific Grove, California, United States

CITED BY 37

	Vincent Dornic , Pierre Jouvelot , David K. Gifford, Polymorphic time systems for estimating program complexity, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.1, p.33-45, March 1992
	David Walker , Kevin Watkins, On regions and linear types (extended abstract), ACM SIGPLAN Notices, v.36 n.10, October 2001
	Guillermo Juan Rozas, Taming the Y operator, ACM SIGPLAN Lisp Pointers, v.V n.1, p.226-234, Jan. 1992
	K. Rustan M. Leino , Arnd Poetzsch-Heffter , Yunhong Zhou, Using data groups to specify and check side effects, ACM SIGPLAN Notices, v.37 n.5, May 2002
	Sabine Glesner , Wolf Zimmermann, Natural semantics as a static program analysis framework, ACM Transactions on Programming Languages and Systems (TOPLAS), v.26 n.3, p.510-577, May 2004
	Mads Tofte, A brief introduction to regions, ACM SIGPLAN Notices, v.34 n.3, p.186-195, March 1999
	Jens Palsberg, Type-based analysis and applications, Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, p.20-27, June 2001, Snowbird, Utah, United States
	Brian Reistad , David K. Gifford, Static dependent costs for estimating execution time, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.65-78, July-Sept. 1994
	Edwin C. Chan , John T. Boyland , William L. Scherlis, Promises: limited specifications for analysis and manipulation, Proceedings of the 20th international conference on Software engineering, p.167-176, April 19-25, 1998, Kyoto, Japan
	David N. Turner , Philip Wadler , Christian Mossin, Once upon a type, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.1-11, June 26-28, 1995, La Jolla, California, United States
	Lorenz Huelsbergen , James R. Larus, Dynamic program parallelization, ACM SIGPLAN Lisp Pointers, v.V n.1, p.311-323, Jan. 1992
	Lars Birkedal , Mads Tofte , Magnus Vejlstrup, From region inference to von Neumann machines via region representation inference, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.171-183, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Cormac Flanagan , Stephen N. Freund, Detecting race conditions in large programs, Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, p.90-96, June 2001, Snowbird, Utah, United States
	Mads Tofte , Lars Birkedal, A region inference algorithm, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.4, p.724-767, July 1998
	Viktor Kuncak , Patrick Lam , Martin Rinard, Role analysis, ACM SIGPLAN Notices, v.37 n.1, p.17-32, Jan. 2002
	Mads Tofte , Jean-Pierre Talpin, Implementation of the typed call-by-value λ-calculus using a stack of regions, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.188-201, January 16-19, 1994, Portland, Oregon, United States
	Andrew C. Myers , Barbara Liskov, A decentralized model for information flow control, ACM SIGOPS Operating Systems Review, v.31 n.5, p.129-142, Dec. 1997
	Cormac Flanagan , Stephen N. Freund, Type-based race detection for Java, ACM SIGPLAN Notices, v.35 n.5, p.219-232, May 2000
	Simon L. Peyton Jones , Philip Wadler, Imperative functional programming, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.71-84, March 1993, Charleston, South Carolina, United States
	Karl Crary , David Walker , Greg Morrisett, Typed memory management in a calculus of capabilities, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.262-275, January 20-22, 1999, San Antonio, Texas, United States
	Patrick Cousot, Types as abstract interpretations, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.316-331, January 15-17, 1997, Paris, France
	Jon G. Riecke , Ramesh Viswanathan, Isolating side effects in sequential languages, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-12, January 23-25, 1995, San Francisco, California, United States
	Martin Abadi , Cormac Flanagan , Stephen N. Freund, Types for safe locking: Static race detection for Java, ACM Transactions on Programming Languages and Systems (TOPLAS), v.28 n.2, p.207-255, March 2006
	David Walker , Karl Crary , Greg Morrisett, Typed memory management via static capabilities, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.4, p.701-771, July 2000
	Philip Wadler, The essence of functional programming, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-14, January 19-22, 1992, Albuquerque, New Mexico, United States
	Flemming Nielson, Perspectives on program analysis, ACM Computing Surveys (CSUR), v.28 n.4es, Dec. 1996
	Mads Tofte , Lars Birkedal , Martin Elsman , Niels Hallenberg, A Retrospective on Region-Based Memory Management, Higher-Order and Symbolic Computation, v.17 n.3, p.245-265, September 2004
	Simon Helsen , Peter Thiemann, Polymorphic specialization for ML, ACM Transactions on Programming Languages and Systems (TOPLAS), v.26 n.4, p.652-701, July 2004
	Shin-Ya Nishizaki, A Polymorphic Environment Calculus and its Type-Inference Algorithm, Higher-Order and Symbolic Computation, v.13 n.3, p.239-278, Sept. 2000
	Miley Semmelroth , Amr Sabry, Monadic encapsulation in ML, ACM SIGPLAN Notices, v.34 n.9, p.8-17, Sept. 1999
	Kevin Glynn , Peter J. Stuckey , Martin Sulzmann , Harald Søndergaard, Exception analysis for non-strict languages, ACM SIGPLAN Notices, v.37 n.9, p.98-109, September 2002
	Robert Givan , David Mcallester, Polynomial-time computation via local inference relations, ACM Transactions on Computational Logic (TOCL), v.3 n.4, p.521-541, October 2002
	Haiying Xu , Christopher J. F. Pickett , Clark Verbrugge, Dynamic purity analysis for java programs, Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, p.75-82, June 13-14, 2007, San Diego, California, USA
	Stephen Tse , Steve Zdancewic, Run-time principals in information-flow type systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.30 n.1, p.6-es, November 2007
	Simon Helsen, Bisimilarity for the Region Calculus, Higher-Order and Symbolic Computation, v.17 n.4, p.347-394, December 2004
	Torben Amtoft , Flemming Nielson , Hanne Riis Nielson, Type and behaviour reconstruction for higher-order concurrent programs, Journal of Functional Programming, v.7 n.3, p.321-347, May 1997
	Jean-Christophe Filliâtre, Verification of non-functional programs using interpretations in type theory, Journal of Functional Programming, v.13 n.4, p.709-745, July 2003