ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
6
views
31
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,608
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computational Logic
Research Directions in Rewriting Logic
other
Author(s):
José Meseguer
Publication date
(Print):
1999
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
New directions in predictive processing
Most cited references
31
Record
: found
Abstract
: not found
Book
: not found
Petri Nets
Wolfgang Reisig
(1985)
0
comments
Cited
118
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Conditional rewriting logic as a unified model of concurrency
José Meseguer
(1992)
0
comments
Cited
113
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Review of the elements of 2-categories
G. M. Kelly
,
Ross Street
(1974)
0
comments
Cited
104
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1999
Pages
: 347-398
DOI:
10.1007/978-3-642-58622-4_10
SO-VID:
23afb7f1-5e1c-44db-969d-a7a7b42ccac3
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Game Semantics
pp. 57
Notes on the Simply Typed Lambda Calculus
pp. 99
Problems in Type Theory
pp. 113
Formal Correctness Proofs of Functional Programs: Dijkstra’s Algorithm, a Case Study
pp. 127
Propositional Proof Complexity an Introduction
pp. 179
Formalizing Decidability Theorems About Automata
pp. 215
On the Meaning of Logical Rules I: Syntax Versus Semantics
pp. 273
Complexity of Primitive Recursion
pp. 301
Computers, Reasoning and Mathematical Practice
pp. 347
Research Directions in Rewriting Logic
pp. 399
Sequent Calculus and the Specification of Computation
Similar content
2,608
On the storage capacity of rewritable memories
Authors:
Christoph Bunte
,
Amos Lapidoth
Moisture-Induced reversible structure conversion of Zero-Dimensional organic cuprous bromide hybrids for multiple photoluminescent anti-Counterfeiting, information encryption and rewritable luminescent paper
Authors:
Ye Tian
,
Hui Peng
,
Qilin Wei
…
Comment: Evolution 2.0—Rewriting the Biosphere
Authors:
Henk van den Belt
See all similar
Cited by
3
A Method to Translate Order-Sorted Algebras to Many-Sorted Algebras
Authors:
Liyi Li
,
Elsa Gunter
The Leader Election Protocol of IEEE 1394 in Maude⋆ ⋆Research supported by CICYT project Desarrollo Formal de Sistemas Distribuidos (TIC97-0669-C03-01).
Authors:
Alberto Verdejo
,
Isabel Pita
,
Narciso Martí-Oliet
A Method to Translate Order-Sorted Algebras to Many-Sorted Algebras
Authors:
Elsa Gunter
,
Liyi Li
See all cited by