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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germania
Broschiert. Condizione: Gut. 370 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 570. Codice articolo 2194662
Quantità: 1 disponibili
Da: Books Puddle, Woodside, NY, U.S.A.
Condizione: New. pp. 388. Codice articolo 26357869980
Quantità: 4 disponibili
Da: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 semantic. Codice articolo 4879602
Quantità: Più di 20 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 388 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam. Codice articolo 354620995
Quantità: 4 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. bilingual edition. 388 pages. French language. 9.60x6.69x0.88 inches. In Stock. Codice articolo x-3540074163
Quantità: 2 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 388. Codice articolo 18357869974
Quantità: 4 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9783540074168
Quantità: 1 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 388 pp. Englisch. Codice articolo 9783540074168
Quantità: 1 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: Neu. ¿-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 | C. Böhm | Taschenbuch | xii | Englisch | Springer | EAN 9783540074168 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Codice articolo 105088117
Quantità: 5 disponibili