Sciweavers

119 search results - page 23 / 24
» Alpha-Structural Recursion and Induction
Sort
View
POPL
2008
ACM
14 years 10 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...
ALT
2002
Springer
14 years 6 months ago
Classes with Easily Learnable Subclasses
In this paper we study the question of whether identifiable classes have subclasses which are identifiable under a more restrictive criterion. The chosen framework is inductive ...
Sanjay Jain, Wolfram Menzel, Frank Stephan
FCT
2007
Springer
14 years 4 months ago
Rewriting Systems with Data
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
KDD
2009
ACM
175views Data Mining» more  KDD 2009»
14 years 2 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...
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 3 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...