283
edits
Pipe-calculus: Difference between revisions
→Connection to other fields
KalmanKeri (talk | contribs) (→Syntax) |
KalmanKeri (talk | contribs) |
||
| Line 36: | Line 36: | ||
=== Connection to other fields === | === Connection to other fields === | ||
Pipe-calculus is inspired by | Pipe-calculus is examined primarily as a process calculus. However it significantly differs from typical process calculi, it still lends itself to this style of presentation. | ||
Its development is also inspired by logic programming, substructural logic, formal grammars, automata theory, type theory (up to the lambda-cube) and algebraic effects. | |||
In certain cases the connection can be made more precise. | In certain cases the connection with these fields can be made more precise. | ||
* Programs written in pipe-calculus can recognize and generate words of formal languages encoded as terms. | * Programs written in pipe-calculus can recognize and generate words of formal languages encoded as terms. There is an interest in finding correspondence between variants of pipe-calculus and classes of formal languages. | ||
* Untyped lambda calculus can be translated to a subset of higher-order pipe-calculus. | * Untyped lambda calculus can be translated to a subset of higher-order pipe-calculus (to be specified later). | ||
=== Variants and computational power === | === Variants and computational power === | ||