Format:
Online-Ressource (XII, 370 S.)
Edition:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540379447
Series Statement:
Lecture notes in computer science 37
Content:
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.
Note:
Literaturangaben
Additional Edition:
ISBN 3540074163
Additional Edition:
ISBN 0387074163
Additional Edition:
ISBN 9783540074168
Additional Edition:
Erscheint auch als Druck-Ausgabe [Lambda]-calculus and computer science theory Berlin : Springer, 1975 ISBN 3540074163
Additional Edition:
ISBN 0387074163
Language:
English
Subjects:
Computer Science
,
Economics
Keywords:
Informatik
;
Lambda-Kalkül
;
Programmiersprache
;
Kombinatorische Logik
;
Programmiersprache
;
Kombinatorische Logik
;
Logik
;
Lambda-Kalkül
;
Metamathematik
;
Konferenzschrift
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
