39 search results - page 5 / 8 » Semantics of Higher-Order Recursion Schemes |
ICPR
2006
IEEE
16 years 24 days ago
2006
IEEE
This paper presents a methodology for semantic understanding of complex and continued human activities. A context-free grammar (CFG) based representation scheme developed earlier ...
171
click to vote
POPL
2004
ACM
16 years 8 hour ago
2004
ACM
In the interest of designing a recursive module extension to ML that is as simple and general as possible, we propose a novel type system for general recursion over effectful expr...
105
click to vote
LISP
2007
14 years 11 months ago
2007
In this paper we propose a new generic scheme CFLP(D ), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given co...
FOSSACS
2010
Springer
15 years 6 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
107
click to vote
LOPSTR
1998
Springer
15 years 3 months ago
1998
Springer
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic pro...