Provable isomorphisms and domain equations in models of typed languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Provable isomorphisms and domain equations in models of typed languages

Full text

Pdf (669 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the seventeenth annual ACM symposium on Theory of computing table of contents

Providence, Rhode Island, United States

Pages: 263 - 272

Year of Publication: 1985

ISBN:0-89791-151-2

Authors

K B Bruce	Department of Mathematical Sciences, Williams College, Williamstown, Ma.
G Longo	Dipartimento di Informatica, Universita di Pisa, Pisa, Italy

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 10, Citation Count: 7

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/22145.22175 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.

	1	Barendregt, H. {1984}, Tha lambda calculus,' its syntax and semantic~ Revised edition, North Holland.
	2	Corrado Böhm , Mariangiola Dezani-Ciancaglini, Combinatorial Problems, Combinator Equations and Normal Forms, Proceedings of the 2nd Colloquium on Automata, Languages and Programming, p.185-199, July 29-August 02, 1974
	3	Kim B. Bruce , Albert R. Meyer, The semantics of second order polymorphic lambda calculus., Proc. of the international symposium on Semantics of data types, p.131-156, July 1984, Sophia-Antipolis, France
	4	Curry, H. B., Hindley, R., Seldin, J. {1972} Combinator y Lo#/c 11. North-Holland.
	5	De Bruijn, N. {1980}, "A survey of the project AUTOMATH," m Hindley & Seldin{19S0}.
	6	Dezani-CianeagUni, M. {1976}, "Characterization of normal forms possessing an inverse in the J~{~q -calculus," Theor. Comp. Sci., 2 (323-337).
	7	Friedman, H. {1971}, "Equality between functionals," L~/c Co//oqu/um (Parikh ed.), LNM 453, Springer-Verlag.
	8	Girard, J. {1971}, "Interpretation fonetioneHe et elimination des eoupure dans i'arithmeti~ d'ordre superieur," These de Doetornt d'Etat, Paris.
	9	Hindley, iL {1969}, 'The principal type-scheme of an object in Combinatory Logic," Trans, AMS, 146 (22-60).
	10	Hindley R., Seldin, J. {1980}, To liB. Curry.' ~'ssays in ~ombinatory Logic, Lambda calculus and formalism. Academic Press.
	11	Longo, G., Moglti, E. {1984}, "Godel numberings, Principal morphisms, Combinatm~ Algebras," (revised version), Dip. Informatica, Universita' di Pisa
	12	Margharia, 1., ~, M. {1983}, "Right and left inverttbility in ),l-calculus," R.A.I.R.O., 17, no.I (71-88).
	13	Nancy Jean Mccracken, An investigation of a programming language with a polymorphic type structure., 1979
	14	McCraken, N.J. {1985}, "A flnitary retract model for the polymorphic lambda-calculus," to appear, Information and Con~ol.
	15	Meyer, A. {1982}, "What is a model of the lambda calculus?." Information & Control 52 {87-I Z2)
	16	Meyer, A., Statman, R. {1984}, Personal communication.
	17	John C. Reynolds, Towards a theory of type structure, Programming Symposium, Proceedings Colloque sur la Programmation, p.408-423, April 09-11, 1974
	18	Reynolds. j. {1984}, "Polymorphlsm Is not set-theoretic," Symposium on Semant/cs of Data Types, (Kahn, MacQueen,Plotk~, eds.) LNCS 173, Springer-Verlag.
	19	Scott, D~S. {1976}, "Data types as lattices," SIAM J. Comp., 5, no. 3 (522-587).
	20	Statman, R. {1983}, "),-definable functionals and ~-conversjon," Arch. Math. LogJk, 23 (21-26).

CITED BY 7

	Zdzisław Spławski , Paweł Urzyczyn, Type fixpoints: iteration vs. recursion, ACM SIGPLAN Notices, v.34 n.9, p.102-113, Sept. 1999
	Robero Di Cosmo, Type isomorphisms in a type-assignment framework, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.200-210, January 19-22, 1992, Albuquerque, New Mexico, United States
	Yoav Zibin , Joseph (Yossi) Gil , Jeffrey Considine, Efficient algorithms for isomorphisms of simple types, ACM SIGPLAN Notices, v.38 n.1, p.160-171, January 2003
	Sergei Soloviev, Foreword, Mathematical Structures in Computer Science, v.15 n.5, p.821-823, October 2005
	Roberto Di Cosmo, A short survey of isomorphisms of types, Mathematical Structures in Computer Science, v.15 n.5, p.825-838, October 2005
	Joseph Gil , Yoav Zibin, Efficient algorithms for isomorphisms of simple types, Mathematical Structures in Computer Science, v.15 n.5, p.917-957, October 2005
	Aleksy Schubert, On the building of affine retractions, Mathematical Structures in Computer Science, v.18 n.4, p.753-793, August 2008