OBJ (programming language): Difference between revisions

Revision as of 02:19, 23 May 2005

Revision as of 23:28, 30 August 2005

Line 1:

'''OBJ''' is a [[programming language]] family introduced by [[Joseph Goguen]] in [[1976]].

A family of [[declarative programming|declarative]] "ultra high -level" languages. [[abstract data type|Abstract types]], [[generic module|generic modules]], [[subsort|subsorts]] (subtypes with [[multiple inheritance]]), [[pattern matching|pattern-matching]] modulo equations, E-strategies (user control over [[lazy evaluation|laziness]]), module expressions (for combining modules), theories and views (for describing [[module interface|module interfaces]]). For the massively parallel RRM ([[Rewrite Rule Machine]]).

Important members of the OBJ family of languages include [[CafeOBJ]], [[Eqlog]], [[FOOPS]], [[Kumo (OBJ)|Kumo]], [[Maude (OBJ)|Maude]] and [[OBJ3]].

["Higher-Order Functions Considered Unnecessary for Higher-Order Programming", J.A. Goguen, in Research Topics in Functional Programming].

==See also==

* [[Automated theorem proving]]

* [[Formal methods]]

* [[Functional programming]]

==Reference==

["* ''Higher-Order Functions Considered Unnecessary for Higher-Order Programming"'', J.A. Goguen, in ''Research Topics in Functional Programming]''.

==External links==

*[http://vl.fmnet.info/obj/ The OBJ archive]

*[http://www.cs.ucsd.edu/users/goguen/sys/obj.html The OBJ family]

{{FOLDOC}}

[[Category:Formal methods]]

[[Category:Functional languages]]

[[Category:Logic in computer science]]

[[Category:Programming languages]]

[[Category:Specification languages]]

[[Category:Theorem provers]]

{{compu-lang-stub}}

{{Compucompu-langsoft-stub}}