Executable Relational Specifications of Polymorphic Type Systems Using Prolog

Ahn, Ki Yung; Vezzosi, Andrea

doi:10.1007/978-3-319-29604-3_8

Cited by 4 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This offers a range of relational domain specific languages for ML, Rust, Haskell and many other languages. As Ahn and Vezzosi (2016) point out, a relational language can be very convenient in encodings of type inference problems.…”

Section: B) ← Type(γ M a → B) ∧ Type(γ N A)mentioning

confidence: 99%

Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis

Farka¹,

Ekaterina²,

Hammond³

2018

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

First-order resolution has been used for type inference for many years, including in Hindley-Milner type inference, type-classes, and constrained data types. Dependent types are a new trend in functional languages. In this paper, we show that proof-relevant first-order resolution can play an important role in automating type inference and term synthesis for dependently typed languages. We propose a calculus that translates type inference and term synthesis problems in a dependently typed language to a logic program and a goal in the proof-relevant first-order Horn clause logic. The computed answer substitution and proof term then provide a solution to the given type inference and term synthesis problem. We prove the decidability and soundness of our method.

show abstract

Section: B) ← Type(γ M a → B) ∧ Type(γ N A)mentioning

confidence: 99%

Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis

Farka¹,

Ekaterina²,

Hammond³

2018

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…Abstract compilation [5,8] is a technique developed in the context of object-oriented programming to exploit the potentialities of logic programming for supporting advanced static type analysis, as investigated also by other authors [23,1].…”

Section: Abstract Compilationmentioning

confidence: 99%

“…Object-oriented programming is the most widespread computational paradigm in programming languages 1 . Statically typed languages like Java, C#, and C++ are heavily employed for large scale software development in several domains; however, for implementing applications based on Web or scientific programming, where often less skilled developers are involved, dynamically typed object-oriented languages like JavaScript and Python have gained more popularity for their gentler learning curve, flexibility and ease of use.…”

Section: Introductionmentioning

confidence: 99%

Structural Resolution for Abstract Compilation of Object-Oriented Languages

Franceschini

Ancona

Komendantskaya

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We propose abstract compilation for precise static type analysis of object-oriented languages based on coinductive logic programming. Source code is translated to a logic program, then type-checking and inference problems amount to queries to be solved with respect to the resulting logic program. We exploit a coinductive semantics to deal with infinite terms and proofs produced by recursive types and methods. Thanks to the recent notion of structural resolution for coinductive logic programming, we are able to infer very precise type information, including a class of irrational recursive types causing non-termination for previously considered coinductive semantics. We also show how to transform logic programs to make them satisfy the preconditions for the operational semantics of structural resolution, and we prove this step does not affect the semantics of the logic program.

show abstract

Proceedings of the First Workshop on Coalgebra, Horn Clause Logic Programming and Types

Ahn

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Executable Relational Specifications of Polymorphic Type Systems Using Prolog

Cited by 4 publications

References 20 publications

Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis

Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis

Structural Resolution for Abstract Compilation of Object-Oriented Languages

Proceedings of the First Workshop on Coalgebra, Horn Clause Logic Programming and Types

Contact Info

Product

Resources

About