Les modeles informatiques des λ-calculs (English)
National licence
- New search for: Nolin, Louis
- New search for: Nolin, Louis
In:
λ-Calculus and Computer Science Theory
;
166-176
;
1975
-
ISBN:
- Article/Chapter (Book) / Electronic Resource
-
Title:Les modeles informatiques des λ-calculs
-
Contributors:Nolin, Louis ( author )
-
Published in:λ-Calculus and Computer Science Theory ; 166-176Lecture Notes in Computer Science ; 37 ; 166-176
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:1975-01-01
-
Size:11 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Combinators and classesScott, Dana et al. | 1975
- 27
-
Least fixed points revisitedBakker, J. W. et al. | 1975
- 62
-
Infinite normal forms for the λ-calculusNakajima, Reiji et al. | 1975
- 83
-
A survey of some useful partial order relations on terms of the lambda calculusHyland, J. M. E. et al. | 1975
- 96
-
λ-Terms as total or partial functions on normal formsBöhm, Corrado / Dezani-Ciancaglini, Mariangiola et al. | 1975
- 122
-
Continuous semantics and inside-out reductionsWelch, P. H. et al. | 1975
- 147
-
An algebraic interpretation of the λβK-calculus and a labelled λ-calculusLevy, Jean-Jacques et al. | 1975
- 166
-
Les modeles informatiques des λ-calculsNolin, Louis et al. | 1975
- 177
-
On the description of time varying systems in λ-calculusAusiello, Giorgio et al. | 1975
- 192
-
Unification in typed lambda calculusHuet, Gérard et al. | 1975
- 213
-
A condition for identifying two elements of whatever model of combinatory logicJacopini, G. et al. | 1975
- 220
-
Typed meaning in Scott's λ-calculus modelsEgli, Herbert et al. | 1975
- 240
-
Programming language semantics in a typed lambda-calculusAiello, Luigia / Aiello, Mario et al. | 1975
- 252
-
Big trees in a λ-calculus with λ-expressions as typesVrijer, Roel et al. | 1975
- 272
-
Normed uniformly reflexive structuresBarendregt, Henk et al. | 1975
- 287
-
A model with nondeterministic computationZilli, Marisa Venturini et al. | 1975
- 297
-
On subrecursiveness in weak combinatory logicBatini, Carlo / Pettorossi, Alberto et al. | 1975
- 312
-
Sequentially and parallelly computable functionalsSazonov, Y. Y. et al. | 1975
- 319
-
Computation on arbitrary algebrasDubinsky, A. et al. | 1975
- 342
-
On solvability by λI-termsKlop, J. W. et al. | 1975
- 346
-
Some philosophical issues concerning theories of combinatorsScott, Dana et al. | 1975
- 367
-
Open problemsBarendregt, Henk et al. | 1975
- IX
-
IntroductionBöhm, Corrado et al. | 1975