Cantitate/Preț
Produs
Total produse
Vezi coșul
Algebraic and Logic Programming de Michael Hanus

Algebraic and Logic Programming

Editat de Michael Hanus, Jan Heering, Karl Meinke
en Limba Engleză Paperback – 20 aug 1997
This book constitutes the refereed proceedings of the 6th International Conference on Algebraic and Logic Programming, ALP '97 and the 3rd International Workshop on Higher-Order Algebra, Logic and Term Rewriting, HOA '97, held jointly in Southampton, UK, in September 1997.
The 18 revised full papers presented in the book were selected from 31 submissions. The volume is divided in sections on functional and logic programming, higher-order methods, term rewriting, types, lambda-calculus, and theorem proving methods.
Citește tot Restrânge

Preț: 32160 lei

Preț vechi: 40200 lei
-20% Nou

Puncte Express: 482
Preț estimativ în valută:
5691€ • 6682$ • 4995£

Carte tipărită la comandă

Livrare economică 27 ianuarie-10 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540634591
ISBN-10: 3540634592
Pagini: 308
Ilustrații: XI, 297 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.47 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Safe folding/unfolding with conditional narrowing.- Optimal non-deterministic functional logic computations.- A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints.- Parallelizing functional programs by generalization.- Higher-order equational unification via explicit substitutions.- Parameterised higher-order algebraic specifications.- Higher-order lazy narrowing calculus: A computation model for a higher-order functional logic language.- On composable properties of term rewriting systems.- Needed reductions with context-sensitive rewriting.- Conditional term graph rewriting.- Lazy narrowing with parametric order sorted types.- Termination of algebraic type systems: The syntactic approach.- Proof net semantics of proof search computation.- Explicit substitutions for the ??-calculus.- A left-linear variant of ??.- Perpetuality and uniform normalization.- Model generation with existentially quantified variables and constraints.- Optimal left-to-right pattern-matching automata.