Sciweavers

1131 search results - page 125 / 227
» Logic Programming, Functional Programming, and Inductive Def...
Sort
View
87
Voted
ICFP
2005
ACM
16 years 17 days ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
110
Voted
KDD
2009
ACM
175views Data Mining» more  KDD 2009»
15 years 5 months ago
Multi-class protein fold recognition using large margin logic based divide and conquer learning
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
Huma Lodhi, Stephen Muggleton, Michael J. E. Stern...
95
Voted
ENTCS
2000
83views more  ENTCS 2000»
15 years 13 days ago
Typed Logical Variables in Haskell
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
Koen Claessen, Peter Ljunglöf
POPL
2007
ACM
16 years 28 days ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
117
Voted
POPL
2012
ACM
13 years 8 months ago
The marriage of bisimulations and Kripke logical relations
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Va...