Category Theory and Computer Science
Editat de David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew Pitts, Axel Poigne, David E. Rydehearden Limba Engleză Paperback – 21 aug 1991
Preț: 377.20 lei
Puncte Express: 566
Preț estimativ în valută:
66.71€ • 76.76$ • 57.61£
66.71€ • 76.76$ • 57.61£
Carte tipărită la comandă
Livrare economică 30 aprilie-14 mai
Specificații
ISBN-13: 9783540544951
ISBN-10: 354054495X
Pagini: 316
Ilustrații: VIII, 304 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354054495X
Pagini: 316
Ilustrații: VIII, 304 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Stone duality for stable functions.- Bifinite domains: Stable case.- Local variables and non-interference in algol-like languages.- Categories of information systems.- Collapsing graph models by preorders.- Linear logic and interference control.- Higher dimensional word problem.- BCK-formulas having unique proofs.- Proof nets and coherence theorems.- A modular approach to denotational semantics.- Programs in partial algebras — A categorical approach.- Tail recursion from universal invariants.- A direct proof of the intuitionistic Ramsey Theorem.- Constructions and predicates.- Relating models of impredicative type theories.- Two results on set-theoretic polymorphism.- An algebra of graphs and graph rewriting.- Dataflow networks are fibrations.- Applications of the calculus of trees to process description languages.