Sciweavers

3738 search results - page 8 / 748
» Parametrized Logic Programming
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Learning Programs: A Hierarchical Bayesian Approach
We are interested in learning programs for multiple related tasks given only a few training examples per task. Since the program for a single task is underdetermined by its data, ...
Percy Liang, Michael I. Jordan, Dan Klein
ICFP
2010
ACM
13 years 8 months ago
Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
Stefan Holdermans, Jurriaan Hage
CADE
2010
Springer
13 years 9 months ago
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
Brigitte Pientka, Joshua Dunfield
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
14 years 6 days ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
POPL
1997
ACM
13 years 12 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones