References
John Hannan. Investigating a Proof-Theoretic Meta-Language for Functional Programs. PhD thesis, University of Pennsylvania, January 1991. Available as MSCIS-91-09.
John Hannan. Implementing λ-calculus reduction strategies in extended logic programming languages. In L. Hallnäs, editor, Proceedings of the Second Workshop on Extensions to Logic Programming, pages 193–219. Springer-Verlag LNCS 596, 1992.
John Hannan. Extended natural semantics. Journal of Functional Programming, 3(2):123–152, 1993.
John Hannan and Patrick Hicks. Higher-order unCurrying. In Proceedings of the 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 1–11, January 1998.
John Hannan and Dale Miller. A meta-logic for functional programming. In H. Abramson and M. Rogers, editors, Meta-Programming in Logic Programming, chapter 24, pages 453–476. MIT Press, 1989.
Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497–536, 1991.
Dale Miller and Gopalan Nadathur. A logic programming approach to manipulating formulas and programs. In Proceedings of the IEEE Fourth Symposium on Logic Programming, pages 379–388. IEEE Press, 1987.
Gopalan Nadathur and Dale Miller. An overview of λProlog. In K. Bowen and R. Kowalski, editors, Fifth International Conference and Symposium on Logic Programming, pages 810–827. MIT Press, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hannan, J. (1998). Program analysis in λprolog. In: Palamidessi, C., Glaser, H., Meinke, K. (eds) Principles of Declarative Programming. ALP PLILP 1998 1998. Lecture Notes in Computer Science, vol 1490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056625
Download citation
DOI: https://doi.org/10.1007/BFb0056625
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65012-6
Online ISBN: 978-3-540-49766-0
eBook Packages: Springer Book Archive