8141 search results - page 43 / 1629 » Higher Order Generalization |
140
click to vote
CALCO
2009
Springer
16 years 17 days ago
2009
Springer
Higher-order recursion schemes are equations defining recursively new operations from given ones called “terminals”. Every such recursion scheme is proved to have a least inte...
159
click to vote
ERSHOV
2009
Springer
16 years 17 days ago
2009
Springer
One of the applications of supercompilation is proving properties
of programs.We focus in this paper on a speci c task: proving term
equivalence for a higher-order lazy functiona...
153
click to vote
FSEN
2009
Springer
16 years 16 days ago
2009
Springer
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
143
click to vote
ICTAC
2009
Springer
16 years 16 days ago
2009
Springer
Abstract. In higher-order process calculi the values exchanged in communications may contain processes. There are only two capabilities for received processes: execution and forwar...
