λ-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

AvC. Böhm

Häftad, Engelska, 1975

Del i serien Lecture Notes in Computer Science

556 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1975-11-01
Mått:170 x 244 x 21 mm
Vikt:668 g
Format:Häftad
Språk:Engelska, Franska
Serie:Lecture Notes in Computer Science
Antal sidor:371
Upplaga:1975
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540074168

Utforska kategorier

Innehållsförteckning

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.- Somephilosophical issues concerning theories of combinators.- Open problems.

Du kanske också är intresserad av

Nyhet

L’amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

Del 490

Geometry of Metric and Linear Spaces

L. M. Kelly

Häftad, 1975

501 kr

Etudes economiques de l'OCDE : Islande 1975

OECD

E-bok

1975

277 kr

CAAP '81

E. Astesiano, C. Böhm

Häftad, 1981

556 kr

Del 492

Infinitary Logic

D. W. Kueker

Häftad, 1975

501 kr

Del 123

Titan und Stahl in der Knochenchirurgie

T.P. Rüedi

Häftad, 1975

588 kr

Foreign Language Tests and Reviews

Buros Center

Inbunden, 1975

579 kr

Late Mrs Early

Norman Robbins

Häftad, 1975

219 kr

Automata, Languages and Programming

G. Ausiello, C. Böhm

Häftad, 1978

556 kr

Modern Microeconomics

A. Koutsoyiannis

E-bok

1975

242 kr

λ-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

AvC. Böhm

Häftad, Engelska, 1975

Del i serien Lecture Notes in Computer Science

556 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1975-11-01
Mått:170 x 244 x 21 mm
Vikt:668 g
Format:Häftad
Språk:Engelska, Franska
Serie:Lecture Notes in Computer Science
Antal sidor:371
Upplaga:1975
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540074168

Utforska kategorier

Innehållsförteckning

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.- Somephilosophical issues concerning theories of combinators.- Open problems.