Back to Results
First PageMeta Content
Proof theory / Metalogic / Model theory / Formal languages / Deduction / Curry–Howard correspondence / Standard ML / Sequent calculus / Symbol / Logic / Mathematics / Mathematical logic


Proof-Theoretic and Higher-Order Extensions of Logic Programming Alberto Momigliano1,2 and Mario Ornaghi1 1 Dipartimento di Scienze dell’Informazione, Universit`a degli Studi di Milano, Italy
Add to Reading List

Document Date: 2010-03-30 09:07:46


Open Document

File Size: 168,30 KB

Share Result on Facebook

City

Milano / /

Company

idealized LP / /

Country

Italy / /

/

Facility

The University of Edinburgh / /

IndustryTerm

abstract logic programming systems / linear algorithm / nifty applications / uniform proof search / goal-oriented proof search / proof search / proof search aspects / proof search mechanism / reverse algorithm / following simple algorithm / /

Organization

Laboratory for the Foundations / Laboratory for the Foundations of Computer Science / School of Informatics / University of Edinburgh / /

Person

Andreoli / /

Position

naive interpreter / head / interpreter / programmer / /

ProgrammingLanguage

Standard ML / Prolog / /

ProvinceOrState

British Columbia / /

Technology

functional programming / /

SocialTag