378 search results - page 12 / 76 » Higher-order transformation of logic programs |
LOPSTR
1997
Springer
15 years 1 months ago
1997
Springer
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
TPHOL
2007
IEEE
15 years 3 months ago
2007
IEEE
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...
135
click to vote
JMLR
2012
13 years 3 days ago
2012
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
PADL
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
76
Voted
CADE
1994
Springer
15 years 1 months ago
1994
Springer
