Towards a logic programming methodology based on higher-order predicates

• This paper outlines a logic programming methodology which applies standardized logic program recursion forms afforded by a system of general purpose recursion schemes. The recursion schemes are conceived of as quasi higher-order predicates which accept pr

Nyckelord

higher-order and metalogic programming; recursion schemes; composition; parameterization; and modularization of logic programs

Publikations- och innehållstyp

ref (ämneskategori)

art (ämneskategori)