80 search results - page 4 / 16 » A general framework for types in graph rewriting |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
: This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generali...
PPDP
2009
Springer
14 years 9 days ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
TLCA
2007
Springer
13 years 12 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
GG
2010
Springer
13 years 3 months ago
2010
Springer
Mesh subdivision algorithms are usually specified informally using graphical schemes defining local mesh refinements. These algorithms are then implemented efficiently in an impera...