Skip to main content
SpringerLink
Log in

The use of justification systems for integrated semantics

  • Conference paper
  • First Online:
COLOG-88 (COLOG 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 417))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balsters, H., Lambda calculus extended with segments. In: Mathematical Logic and Theoretical Computer Science. Lecture Notes in pure and applied mathematics, 106, ed. D.W. Kueker, E.G.K. Lopez-Escobar, C.H. Smith. Marcel Dekker Inc., New York-Basel 1987, pp. 15–28.

    Google Scholar 

  2. Brujin, N.G. de, The mathematical language AUTOMATH, its usage, and some of its extensions. In Symposium on Automatic Demonstration (Versailles, December 1968). Lecture notes in Mathematics, Vol. 125 pp. 29–61, Springer Verlag, 1970.

    Google Scholar 

  3. —, A system for handling syntax and semantics of computer programs in terms of the mathematical language Automath. Report, Department of Mathematics, Eindhoven University of Technology, 1973.

    Google Scholar 

  4. —, Some extensions of Automath: The AUT4-family. Department of Mathematics, Eindhoven University of Technology, 1974.

    Google Scholar 

  5. —, A namefree lambda calculus with facilities for internal definition of expressions and segments. Department of Mathematics, Eindhoven University of Technology, 1978.

    Google Scholar 

  6. —, A survey of the project Automath. In: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, edited by J.P. Seldin and J.R. Hindley, pp. 579–606, Academic Press, 1980.

    Google Scholar 

  7. —, Computer program semantics in space and time. Internal report M8, Department of Mathematics, Eindhoven University of Technology, 1983.

    Google Scholar 

  8. —, Formalization of constructivity in Automath. In: Papers dedicated to J.J. Seidel, pp. 76–101. EUT Report 84-WSK-03. ISSN 0167-9708. Department of Mathematics and Computing Science, Eindhoven University of Technology, 1984.

    Google Scholar 

  9. — Generalizing Automath by means of a lambda-typed lambda calculus. In: Mathematical Logic and Theoretical Computer Science. Lecture Notes in pure and applied mathematics 106, ed. D.W. Kueker, E.G.K. Lopez-Escobar, C.H. Smith. Marcel Dekker Inc., New York-Basel 1987, pp. 71–92.

    Google Scholar 

  10. —, Telescopic mappings in typed lambda calculus (to be published).

    Google Scholar 

  11. Coquand, T. and Huet, G., The calculus of constructions. Information and Computation, vol. 76, 95–120, 1988.

    Google Scholar 

  12. Landau, E., Grundlagen der Analysis. 4th edition. Chelsea Publ. Comp., New York 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, PO Box 513, 5600MB, Eindhoven, The Netherlands

    N. G. de Brujin

Authors
  1. N. G. de Brujin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Per Martin-Löf Grigori Mints

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Brujin, N.G. (1990). The use of justification systems for integrated semantics. In: Martin-Löf, P., Mints, G. (eds) COLOG-88. COLOG 1988. Lecture Notes in Computer Science, vol 417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52335-9_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-52335-9_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52335-2

  • Online ISBN: 978-3-540-46963-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation