Pipe-calculus: Difference between revisions

Pipe-calculus (view source)

Revision as of 21:38, 11 May 2023

6 bytes removed , 11 May 2023

m

no edit summary

KalmanKeri

283

edits

Revision as of 21:35, 11 May 2023 (view source) KalmanKeri (talk \| contribs) (→‎Zero-order calculus) ← Older edit		Revision as of 21:38, 11 May 2023 (view source) KalmanKeri (talk \| contribs) mNo edit summary Newer edit →
Line 1:		Line 1:
	'''Pipe-calculus''' is a universal model of computation ~~that is~~ closely related to [[Wikipedia:process_calculus\|process calculus]], [[Wikipedia:lambda_calculus\|lambda calculus]] and [[Wikipedia:Formal_grammar\|formal grammars]], ~~joining~~ 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]], 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>.
	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.		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.