λ-Calculus and Computer Science Theory (Record no. 33736)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02770nam a22004695i 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783540379447 |
| -- | 978-3-540-37944-7 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.131 |
| 245 10 - TITLE STATEMENT | |
| Title | λ-Calculus and Computer Science Theory |
| Sub Title | Proceedings of the Symposium Held in Rome March 25–27, 1975 / |
| Statement of responsibility, etc | edited by C. Böhm. |
| 260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Berlin, Heidelberg : |
| Name of publisher | Springer Berlin Heidelberg, |
| Year of publication | 1975. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XII, 371 p. |
| Other physical details | online resource. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 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 inside-out reductions -- An algebraic interpretation of the ??K-calculus 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 lambda-calculus -- 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 ?I-terms -- Some philosophical issues concerning theories of combinators -- Open problems. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Logic, Symbolic and mathematical. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Mathematical Logic and Formal Languages. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Mathematical Logic and Foundations. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Böhm, C. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/BFb0029515 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | E-BOOKS |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg, |
| -- | 1975. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 0302-9743 ; |
| Withdrawn status | Lost status | Damaged status | Not for loan | Current library | Accession Number | Uniform Resource Identifier | Koha item type |
|---|---|---|---|---|---|---|---|
| IMSc Library | EBK4442 | http://dx.doi.org/10.1007/BFb0029515 | E-BOOKS |