Search results

...are_hist.pdf | author=C.A.R. Hoare | title=An Axiomatic Basis for Computer Programming | journal=Communications of the ACM | volume=12 | number=10 | pages=576&nda === Rewriting === ...

...in context of termination of programs or [[abstract rewriting system|term rewriting systems]]. ...n ''Proceedings of the International Colloquium on Automata, Languages and Programming'', Graz, Lecture Notes in Computer Science 71, Springer-Verlag, pp. 18 ...

...ction to OBJ3 |title=Proceedings of the First Workshop on Conditional Term Rewriting Systems |series=Lecture Notes in Computer Science |pages=258–263 |publisher The [[Syntax (programming languages)|syntax]] of an [[algebraic specification]] is formulated in two steps: (1) ...

...ith a given reduction relation.<ref name="Kirchner"/> Some authors use the term to refer to an [[evaluation strategy]].<ref>{{cite journal |last1=Selinger ...ast2=van Oostrom |first2=Vincent |last3=van Raamsdonk |first3=Femke |title=Rewriting, Computation and Proof |chapter=Reduction Strategies and Acyclicity |series ...

...''' is a [[data structure]] that stores an [[equivalence relation]] over [[Term (logic)|terms]] of some language. ...Sigma, V)</math>. A term containing variables is called a '''pattern''', a term without variables is called '''ground'''. ...

...at least, a method to represent mathematical data in a computer, a user [[programming language]] (usually different from the language used for the implementation ...2006) | pages = 43–49 |isbn=9788468983813 |oclc=496720771}}</ref> In some languages, the name of the field is not a direct translation of its English name. Typ ...

rewriting from left to right. Barendregt originally introduced<ref name="Barendregt"/> the term ...

...e conference|first1=Hubert|last1=Comon|title=Sufficient Completeness, Term Rewriting Systems and 'Anti-Unification'|book-title=Proc. 8th International Conferenc ...to choose ''V'' disjoint from the set of [[Lambda term#Lambda terms|lambda-term bound variables]]. ...

...words]] <math>u</math> and <math>v</math>, each over an [[Alphabet (formal languages)|alphabet]] <math>\Sigma \cup \Xi</math> comprising both constants (c.f. <m ...link.springer.com/book/10.1007/978-3-642-59136-5 |title=Handbook of Formal Languages |date=1997 |language=en |doi=10.1007/978-3-642-59136-5 |isbn=978-3-642-6386 ...

# locating the smallest potentially reducible term (''potential [[redex]]'') using a given [[reduction strategy]], if this pot |conference=Second International Workshop on Rule-Based Programming (RULE 2001) ...

{{Short description|Type system used in computer programming and mathematics}} ...ctional programs | conference = 9th Symposium on Principles of programming languages (POPL'82) | pages = 207–212 | publisher = ACM | url = http://web.cs.wpi.edu ...

{{term |1=A-proposition}} {{term |1=[[Abductive reasoning|abduction]]}} ...