<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematics / Logic in computer science / Lambda calculus / Formal languages / Mathematical logic / Rewriting / Fixed-point combinator / Sequence / Rewrite order / Substitution
Date: 2015-12-18 06:55:15
Theoretical computer science
Mathematics
Logic in computer science
Lambda calculus
Formal languages
Mathematical logic
Rewriting
Fixed-point combinator
Sequence
Rewrite order
Substitution

Stochastic Calculus of Looping Sequences for the Modelling and Simulation of Cellular Pathways Roberto Barbuti1 , Andrea Maggiolo–Schettini1, Paolo Milazzo1 , Paolo Tiberi1 , and Angelo Troina2 1

Add to Reading List

Source URL: pages.di.unipi.it

Download Document from Source Website

File Size: 280,52 KB

Share Document on Facebook

Similar Documents

ISRFORT Property  arbitrary first-order formula over rewrite relations as predicates

ISRFORT Property  arbitrary first-order formula over rewrite relations as predicates

DocID: 1tN0S - View Document

On Rewriting Terms with Strict Functions and Error Propagation Olaf Owe Department of Informatics University of Oslo September 1990

On Rewriting Terms with Strict Functions and Error Propagation Olaf Owe Department of Informatics University of Oslo September 1990

DocID: 1rjs4 - View Document

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Proving Termination by Dependency Pairs and Inductive Theorem Proving Carsten Fuhs · J¨

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Proving Termination by Dependency Pairs and Inductive Theorem Proving Carsten Fuhs · J¨

DocID: 1reYE - View Document

Aachen Department of Computer Science Technical Report Symbolic Evaluation Graphs and Term Rewriting —

Aachen Department of Computer Science Technical Report Symbolic Evaluation Graphs and Term Rewriting —

DocID: 1oO7l - View Document