Typed SLD-Resolution: Dynamic Typing for Logic Programming

07/30/2022
by   João Barbosa, et al.
0

The semantic foundations for logic programming are usually separated into two different approaches. The operational semantics, which uses SLD-resolution, the proof method that computes answers in logic programming, and the declarative semantics, which sees logic programs as formulas and its semantics as models. Here, we define a new operational semantics called TSLD-resolution, which stands for Typed SLD-resolution, where we include a value "wrong", that corresponds to the detection of a type error at run-time. For this we define a new typed unification algorithm. Finally we prove the correctness of TSLD-resolution with respect to a typed declarative semantics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2019

A Three-Valued Semantics for Typed Logic Programming

Types in logic programming have focused on conservative approximations o...
research
04/25/2009

Guarded resolution for answer set programming

We describe a variant of resolution rule of proof and show that it is co...
research
05/03/2020

Certified Semantics for Relational Programming

We present a formal study of semantics for the relational programming la...
research
05/08/2000

A Denotational Semantics for First-Order Logic

In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational ...
research
08/05/2020

Flexible coinductive logic programming

Recursive definitions of predicates are usually interpreted either induc...
research
09/14/2017

Structural Resolution for Abstract Compilation of Object-Oriented Languages

We propose abstract compilation for precise static type analysis of obje...
research
02/27/2000

SLT-Resolution for the Well-Founded Semantics

Global SLS-resolution and SLG-resolution are two representative mechanis...

Please sign up or login with your details

Forgot password? Click here to reset