My Account Log in

1 option

Processes, Terms and Cycles: Steps on the Road to Infinity : Essays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday / edited by Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel de Vrijer.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Middeldorp, Aart, 1963- editor.
Oostrom, Vincent van, 1966- editor.
van Raamsdonk, Femke, editor.
Vrijer, Roel de, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 3838.
Theoretical Computer Science and General Issues ; 3838
Language:
English
Subjects (All):
Logic, Symbolic and mathematical.
Computer logic.
Artificial intelligence.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Artificial Intelligence.
Mathematical Logic and Foundations.
Local Subjects:
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Artificial Intelligence.
Mathematical Logic and Foundations.
Physical Description:
1 online resource (XVIII, 642 pages).
Edition:
First edition 2005.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
System Details:
text file PDF
Contents:
The Spectra of Words
On the Undecidability of Coherent Logic
Löb's Logic Meets the ?-Calculus
A Characterisation of Weak Bisimulation Congruence
Böhm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms
Explaining Constraint Programming
Sharing in the Weak Lambda-Calculus
Term Rewriting Meets Aspect-Oriented Programming
Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes
Primitive Rewriting
Infinitary Rewriting: From Syntax to Semantics
Reducing Right-Hand Sides for Termination
Reduction Strategies for Left-Linear Term Rewriting Systems
Higher-Order Rewriting: Framework, Confluence and Termination
Timing the Untimed: Terminating Successfully While Being Conservative
Confluence of Graph Transformation Revisited
Compositional Reasoning for Probabilistic Finite-State Behaviors
Finite Equational Bases in Process Algebra: Results and Open Questions
Skew and ?-Skew Confluence and Abstract Böhm Semantics
A Mobility Calculus with Local and Dependent Types
Model Theory for Process Algebra
Expression Reduction Systems and Extensions: An Overview
Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem.
Other Format:
Printed edition:
ISBN:
978-3-540-32425-6
9783540324256
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account