[Lambda]-calculus and computer science theory : proceedings of the symposium held in Rome, March 25-27, 1975
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
2005.
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science
37 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • [Lambda]-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, Berlin, Springer-Verlag, 1975, 1 vol. (XII-370 p.), Lecture notes in computer science, 0-387-07416-3 • -Calculus and Computer Science Theory, Texte imprimé, 9783540074168 • -Calculus and Computer Science Theory, Texte imprimé, 9783662179536 |
Inhaltsangabe:
- 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.