UID:
edoccha_9959186258202883
Format:
1 online resource (XII, 371 p. 1 illus.)
Edition:
1st ed. 1975.
Edition:
Online edition Springer Lecture Notes Archive ; 041142-5
ISBN:
3-540-37944-4
Series Statement:
Lecture Notes in Computer Science, 37
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.
In:
Springer eBooks
Additional Edition:
ISBN 3-540-07416-3
Language:
English
URL:
http://dx.doi.org/10.1007/BFb0029515
