Pipe-calculus: Difference between revisions

Pipe-calculus (view source)

236 bytes removed , 12 May 2023

no edit summary

283

edits

@@ Line 1: / Line 1: @@
-'''Pipe-calculus''' is a universal model of computation closely related to [[Wikipedia:process_calculus|process calculus]], [[Wikipedia:lambda_calculus|lambda calculus]] and [[Wikipedia:Formal_grammar|formal grammars]], following a tradition that studies computation hand in hand with formal languages and automata theory<ref>[[Wikipedia:Introduction_to_Automata_Theory,_Languages,_and_Computation|Introduction to Automata Theory, Languages, and Computation]]</ref>.
+'''Pipe-calculus''' is a universal model of computation closely related to [[Wikipedia:process_calculus|process calculus]], [[Wikipedia:lambda_calculus|lambda calculus]] and [[Wikipedia:Formal_grammar|formal grammars]].
-Its distinctive feature is the inclusion of syntactic primitives, so it is possible to express program structure and data types using only the built-in constructors.
+One of its distinctive features is the inclusion of syntactic symbols, so it is possible to express program structure and complex data types using only the built-in constructs.
 Pure pipe-calculus is untyped. Construction of a [[ideas_for_a_type_system|type system]] is an ongoing effort, placing the focus on well-typed communication of programs.