Skip to main content
SpringerLink
Log in
Book cover

λ-Calculus and Computer Science Theory

Proceedings of the Symposium Held in Rome March 25–27, 1975. IAC - CNR Istituto per le Applicazioni del Calcolo “Mauro Picone” of the Consiglio Nazionale delle Ricerche

  • Conference proceedings
  • © 1975

Overview

Editors:
  1. C. Böhm
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: LCCST 1988.

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

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (23 papers)

  1. Front Matter

    Download chapter PDF

  2. Introduction

    • Corrado Böhm
    Pages IX-IX

  3. Combinators and classes

    • Dana Scott
    Pages 1-26

  4. Least fixed points revisited

    • J. W. de Bakker
    Pages 27-61

  5. Infinite normal forms for the λ-calculus

    • Reiji Nakajima
    Pages 62-82

  6. A survey of some useful partial order relations on terms of the lambda calculus

    • J. M. E. Hyland
    Pages 83-95

  7. λ-Terms as total or partial functions on normal forms

    • Corrado Böhm, Mariangiola Dezani-Ciancaglini
    Pages 96-121

  8. Continuous semantics and inside-out reductions

    • P. H. Welch
    Pages 122-146

  9. An algebraic interpretation of the λβK-calculus and a labelled λ-calculus

    • Jean-Jacques Levy
    Pages 147-165

  10. Les modeles informatiques des λ-calculs

    • Louis Nolin
    Pages 166-176

  11. On the description of time varying systems in λ-calculus

    • Giorgio Ausiello
    Pages 177-191

  12. Unification in typed lambda calculus

    • Gérard Huet
    Pages 192-212

  13. A condition for identifying two elements of whatever model of combinatory logic

    • G. Jacopini
    Pages 213-219

  14. Typed meaning in Scott's λ-calculus models

    • Herbert Egli
    Pages 220-239

  15. Programming language semantics in a typed lambda-calculus

    • Luigia Aiello, Mario Aiello
    Pages 240-251

  16. Big trees in a λ-calculus with λ-expressions as types

    • Roel de Vrijer
    Pages 252-271

  17. Normed uniformly reflexive structures

    • Henk Barendregt
    Pages 272-286

  18. A model with nondeterministic computation

    • Marisa Venturini Zilli
    Pages 287-296

  19. On subrecursiveness in weak combinatory logic

    • Carlo Batini, Alberto Pettorossi
    Pages 297-311

  20. Sequentially and parallelly computable functionals

    • Y. Y. Sazonov
    Pages 312-318
Back to top

Other volumes

  1. λ-Calculus and Computer Science Theory

Keywords

Bibliographic Information

  • Book Title: λ-Calculus and Computer Science Theory

  • Book Subtitle: Proceedings of the Symposium Held in Rome March 25–27, 1975. IAC - CNR Istituto per le Applicazioni del Calcolo “Mauro Picone” of the Consiglio Nazionale delle Ricerche

  • Editors: C. Böhm

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/BFb0029515

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1975

  • Softcover ISBN: 978-3-540-07416-8Published: 01 November 1975

  • eBook ISBN: 978-3-540-37944-7Published: 07 December 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XII, 371

  • Number of Illustrations: 1 b/w illustrations

  • Topics: Mathematical Logic and Formal Languages, Mathematical Logic and Foundations

  • Industry Sectors: IT & Software, Telecommunications

Publish with us

Policies and ethics

Back to top

Search

Navigation