MLnetOiS Logo left

MLnetOiS Logo right

 Community:Projects:Details

 

Index
Community
* Events
* Groups
* Jobs
* Persons
* Projects


HOIDP

Higher Order Inductive Declarative Programming

Add Add a project to the database.
Update Update the entry for this project.

 

 

 

Back

 

 

 

up arrow

Title (abbrev)

Title (full)

Last update

 

HOIDP

Higher Order Inductive Declarative Programming

b D, Y

up arrow

Category

WWW

 

 

ILP

http://www.cs.bris.ac.uk/Research/MachineLearning/hoidp-sum.html

 

up arrow

Description

 

 

Most implemented ILP systems are based on Prolog and hence can take advantage of Prolog's well-defined, efficient mechanisms. However, they also inherit Prolog's limitations. In particular, Prolog is essentially first-order and provides neither higher-order constructs nor declarative meta-programming facilities. Based upon type theory, Escher is a new language that effectively combines the best features of logic and functional programming languages. Escher's programs are equational theories and Escher's computational model is based on rewriting. Hence, Escher offers a unique opportunity to broaden the definition of ILP and to investigate induction in higher-order logics.

 

up arrow

Coordinating Group

 

 

  1. University of Bristol, MLBC group

 

up arrow

Comment (optional)

 

 

This research is supported by the EPSRC (GR/L21884)

 

 

 

 

Index
Community
* Events
* Groups
* Jobs
* Persons
* Projects