Finding fixed point combinators using Prolog
Richard Rankin, Ralph W. Wilkerson · 1993
Article Free Access Share on Finding fixed point combinators using Prolog Authors: Richard Rankin Computer Science Department, University of Missouri-Rolla Computer Science Department, University of Missouri-RollaView Profile , Ralph Wilkerson Computer Science Department, University of Missouri-Rolla Computer Science Department, University of Missouri-RollaView Profile Authors Info & Claims SAC '93: Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practiceMarch 1993 Pages 604–608https://doi.org/10.1145/162754.168691Published:01 March 1993Publication History 0citation187DownloadsMetricsTotal Citations0Total Downloads187Last 12 Months8Last 6 weeks2 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