632 search results - page 44 / 127 » Proving Invariants of Functional Programs |
95
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
114
click to vote
AGP
1997
IEEE
15 years 4 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
120
Voted
JUCS
2006
15 years 16 days ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
114
click to vote
SCP
1998
15 years 6 days ago
1998
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
112
Voted
JMLR
2012
13 years 3 months ago
2012
Unsupervised discovery of latent representations, in addition to being useful for density modeling, visualisation and exploratory data analysis, is also increasingly important for...