Abstract
Recursive and structured metaprogramming facilities are necessary for large proof development in a generic proof manipulation environment. We show how to define a set of mutually inductive types, abstract theories and abstract data types in a LF-like type theory. By interpreting these complex types in an operational way, we get a powerful mechanism to support large proof development.
Preview
Unable to display preview. Download preview PDF.
References
T.Coquand & C.Paulin:: ”Inductively Defined Types”, Proc. of International Conference on Computer Logic, L.N.C.S. 417,1988.
A.Felry & A. Miller: ” Specifying Theorem Provers in a Higher-Order Logic Programming Language”, Proc. of CADE'88, L.N.C.S. 310,1988.
R.Harper & R.Honsell & G.Plotkin: ” A Framework for Defining Logics”, Proc. of LICS'87, 1987.
Zhaohui Luo: ” An Extended Calculus of Constructions”, Ph.D. Thesis, Univ. of Edinburgh, 1990.
L.Paulson:” The Foundations of a Generic Theorem Prover”, Journal of Automated Reasoning, Vol. 5, 1989.
K.Petersson: ” A Set Constructor for Inductive Sets in Martin-Lof Type Theory”, Proc. of Category Method in Computer Science, L.N.C.S. 389,1898.
F.Pfenning: ” Elf: A Language for Logic Definition and Verified Metaprogramming”, Proc. of LICS'89, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, QP., Chen, HW. (1991). On the operational interpretation of complex types. In: Biswas, S., Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1991. Lecture Notes in Computer Science, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54967-6_61
Download citation
DOI: https://doi.org/10.1007/3-540-54967-6_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54967-3
Online ISBN: 978-3-540-46612-3
eBook Packages: Springer Book Archive