|
H ?
«
‹
←
→
›
»
Language peer sets for RELFUN: RELFUN(ID:2446/rel006)alternate simple view-(Relational Functional Language) logic programming language with call-by-value (eager) expressions of non-deterministic, non-ground functions; clauses are Hornish, succeeding with true, or footed, returning any values, and define operations (relations, functions) allowing higher-order syntax with arbitrary terms (constants, structures, variables) as operators. http;//www.dfki.uni-kl.de/~vega/relfun.html Structures: Search in: Google Google scholar World Cat Yahoo Overture DBLP Monash bib NZ IEEE ACM portal CiteSeer CSB ncstrl jstor Bookfinder |