Provable isomorphisms and domain equations in models of typed languages
Kim B. Bruce, Gianfranco Longo · 1985
Article Free Access Share on Provable isomorphisms and domain equations in models of typed languages Authors: K B Bruce Department of Mathematical Sciences, Williams College, Williamstown, Ma. Department of Mathematical Sciences, Williams College, Williamstown, Ma.View Profile , G Longo Dipartimento di Informatica, Universita di Pisa, Pisa, Italy Dipartimento di Informatica, Universita di Pisa, Pisa, ItalyView Profile Authors Info & Claims STOC '85: Proceedings of the seventeenth annual ACM symposium on Theory of computingDecember 1985 Pages 263–272https://doi.org/10.1145/22145.22175Published:01 December 1985Publication History 31citation248DownloadsMetricsTotal Citations31Total Downloads248Last 12 Months21Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF