Type Inference by Coinductive Logic Programming
From MaRDI portal
Publication:3638242
DOI10.1007/978-3-642-02444-3_1zbMath1246.68079OpenAlexW1668790119MaRDI QIDQ3638242
Davide Ancona, Giovanni Lagorio, Elena Zucca
Publication date: 2 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02444-3_1
Related Items (6)
Exploiting parallelism in coalgebraic logic programming ⋮ Idealized coinductive type systems for imperative object-oriented programs ⋮ Preemptive type checking ⋮ Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming ⋮ Abstract Compilation of Object-Oriented Languages into Coinductive CLP(X): Can Type Inference Meet Verification? ⋮ Type Inference by Coinductive Logic Programming
Uses Software
Cites Work
- Fundamental properties of infinite trees
- Intersection and union types: Syntax and semantics
- Idealized coinductive type systems for imperative object-oriented programs
- Principal typings for Java-like languages
- Type Inference by Coinductive Logic Programming
- Polymorphic bytecode
- Co-Logic Programming: Extending Logic Programming with Coinduction
- Coinductive Logic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Type Inference by Coinductive Logic Programming