The Resource [Lambda]calculus and computer science theory : proceedings of the symposium held in Rome, March 2527, 1975, IACCNR, Istituto per le applicazioni del calcolo "Mauro Picone" of the Consiglio nazionale delle ricerche ; edited by C. Böhm
[Lambda]calculus and computer science theory : proceedings of the symposium held in Rome, March 2527, 1975, IACCNR, Istituto per le applicazioni del calcolo "Mauro Picone" of the Consiglio nazionale delle ricerche ; edited by C. Böhm
Resource Information
The item [Lambda]calculus and computer science theory : proceedings of the symposium held in Rome, March 2527, 1975, IACCNR, Istituto per le applicazioni del calcolo "Mauro Picone" of the Consiglio nazionale delle ricerche ; edited by C. Böhm represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item [Lambda]calculus and computer science theory : proceedings of the symposium held in Rome, March 2527, 1975, IACCNR, Istituto per le applicazioni del calcolo "Mauro Picone" of the Consiglio nazionale delle ricerche ; edited by C. Böhm represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 Language

 eng
 fre
 eng
 Extent
 1 online resource (xii, 370 pages)
 Contents

 Combinators and classes
 Least fixed points revisited
 Infinite normal forms for the?calculus
 A survey of some useful partial order relations on terms of the lambda calculus ?Terms as total or partial functions on normal forms
 Continuous semantics and insideout reductions
 An algebraic interpretation of the??Kcalculus and a labelled?calculus
 Les modeles informatiques des?calculs
 On the description of time varying systems in?calculus
 Unification in typed lambda calculus
 A condition for identifying two elements of whatever model of combinatory logic
 Typed meaning in Scott's?calculus models
 Programming language semantics in a typed lambdacalculus
 Big trees in a?calculus with?expressions as types
 Normed uniformly reflexive structures
 A model with nondeterministic computation
 On subrecursiveness in weak combinatory logic
 Sequentially and parallelly computable functionals
 Computation on arbitrary algebras
 On solvability by?Iterms
 Some philosophical issues concerning theories of combinators
 Open problems
 Isbn
 9783540379447
 Label
 [Lambda]calculus and computer science theory : proceedings of the symposium held in Rome, March 2527, 1975
 Title
 [Lambda]calculus and computer science theory
 Title remainder
 proceedings of the symposium held in Rome, March 2527, 1975
 Statement of responsibility
 IACCNR, Istituto per le applicazioni del calcolo "Mauro Picone" of the Consiglio nazionale delle ricerche ; edited by C. Böhm
 Language

 eng
 fre
 eng
 Action
 digitized
 Cataloging source
 OCLCE
 Dewey number
 511/.3
 Illustrations
 illustrations
 Index
 no index present
 Language note
 English or French
 LC call number
 QA9.5
 LC item number
 .L35 1975
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 1975
 http://bibfra.me/vocab/lite/meetingName
 Symposium on [symbol for lambda]Calculus and Computer Science Theory
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorDate
 1923
 http://library.link/vocab/relatedWorkOrContributorName

 Böhm, C.
 Istituto per le applicazioni del calcolo
 Series statement
 Lecture notes in computer science
 Series volume
 37
 http://library.link/vocab/subjectName

 Combinatory logic
 Programming languages (Electronic computers)
 Combinatory logic
 Programming languages (Electronic computers)
 Lambdacalculus
 Computer Science
 Mathematical Logic and Formal Languages
 Mathematical Logic and Foundations
 Label
 [Lambda]calculus and computer science theory : proceedings of the symposium held in Rome, March 2527, 1975, IACCNR, Istituto per le applicazioni del calcolo "Mauro Picone" of the Consiglio nazionale delle ricerche ; edited by C. Böhm
 Antecedent source
 file reproduced from original
 Bibliography note
 Includes bibliographical references
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 black and white
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Combinators and classes  Least fixed points revisited  Infinite normal forms for the?calculus  A survey of some useful partial order relations on terms of the lambda calculus ?Terms as total or partial functions on normal forms  Continuous semantics and insideout reductions  An algebraic interpretation of the??Kcalculus and a labelled?calculus  Les modeles informatiques des?calculs  On the description of time varying systems in?calculus  Unification in typed lambda calculus  A condition for identifying two elements of whatever model of combinatory logic  Typed meaning in Scott's?calculus models  Programming language semantics in a typed lambdacalculus  Big trees in a?calculus with?expressions as types  Normed uniformly reflexive structures  A model with nondeterministic computation  On subrecursiveness in weak combinatory logic  Sequentially and parallelly computable functionals  Computation on arbitrary algebras  On solvability by?Iterms  Some philosophical issues concerning theories of combinators  Open problems
 Control code
 569508687
 Dimensions
 unknown
 Extent
 1 online resource (xii, 370 pages)
 Form of item
 online
 Isbn
 9783540379447
 Level of compression

 lossless
 lossy
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other physical details
 illustrations.
 Reformatting quality

 preservation
 access
 Reproduction note
 Electronic reproduction.
 Specific material designation
 remote
 System control number
 (OCoLC)569508687
 System details
 Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
 Label
 [Lambda]calculus and computer science theory : proceedings of the symposium held in Rome, March 2527, 1975, IACCNR, Istituto per le applicazioni del calcolo "Mauro Picone" of the Consiglio nazionale delle ricerche ; edited by C. Böhm
 Antecedent source
 file reproduced from original
 Bibliography note
 Includes bibliographical references
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 black and white
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Combinators and classes  Least fixed points revisited  Infinite normal forms for the?calculus  A survey of some useful partial order relations on terms of the lambda calculus ?Terms as total or partial functions on normal forms  Continuous semantics and insideout reductions  An algebraic interpretation of the??Kcalculus and a labelled?calculus  Les modeles informatiques des?calculs  On the description of time varying systems in?calculus  Unification in typed lambda calculus  A condition for identifying two elements of whatever model of combinatory logic  Typed meaning in Scott's?calculus models  Programming language semantics in a typed lambdacalculus  Big trees in a?calculus with?expressions as types  Normed uniformly reflexive structures  A model with nondeterministic computation  On subrecursiveness in weak combinatory logic  Sequentially and parallelly computable functionals  Computation on arbitrary algebras  On solvability by?Iterms  Some philosophical issues concerning theories of combinators  Open problems
 Control code
 569508687
 Dimensions
 unknown
 Extent
 1 online resource (xii, 370 pages)
 Form of item
 online
 Isbn
 9783540379447
 Level of compression

 lossless
 lossy
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other physical details
 illustrations.
 Reformatting quality

 preservation
 access
 Reproduction note
 Electronic reproduction.
 Specific material designation
 remote
 System control number
 (OCoLC)569508687
 System details
 Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
Subject
 Combinatory logic  Congresses
 Computer Science
 Conference papers and proceedings
 Lambdacalculus
 Mathematical Logic and Formal Languages
 Mathematical Logic and Foundations
 Programming languages (Electronic computers)
 Programming languages (Electronic computers)  Congresses
 Combinatory logic
Genre
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Lambdacalculusandcomputersciencetheory/aCNn2yi9lM8/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Lambdacalculusandcomputersciencetheory/aCNn2yi9lM8/">[Lambda]calculus and computer science theory : proceedings of the symposium held in Rome, March 2527, 1975, IACCNR, Istituto per le applicazioni del calcolo "Mauro Picone" of the Consiglio nazionale delle ricerche ; edited by C. Böhm</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item [Lambda]calculus and computer science theory : proceedings of the symposium held in Rome, March 2527, 1975, IACCNR, Istituto per le applicazioni del calcolo "Mauro Picone" of the Consiglio nazionale delle ricerche ; edited by C. Böhm
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Lambdacalculusandcomputersciencetheory/aCNn2yi9lM8/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Lambdacalculusandcomputersciencetheory/aCNn2yi9lM8/">[Lambda]calculus and computer science theory : proceedings of the symposium held in Rome, March 2527, 1975, IACCNR, Istituto per le applicazioni del calcolo "Mauro Picone" of the Consiglio nazionale delle ricerche ; edited by C. Böhm</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>