• Home
  • Search
  • Idealized coinductive type systems for imperative object-oriented programs
  • Cite Icon24
  • https://doi.org/10.1051/ita/2011009Copy DOI Icon

Idealized coinductive type systems for imperative object-oriented programs

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In recent work we have proposed a novel approach to define idealized type systems for object-oriented languages, based on abstract compilation of programs into Horn formulas which are interpreted w.r.t. the coinductive (that is, the greatest) Herbrand model. In this paper we investigate how this approach can be applied also in the presence of imperative features. This is made possible by considering a natural translation of Static Single Assignment intermediate form programs into Horn formulas, where φ functions correspond to union types.

Similar Papers
  • Book Chapter
  • Citations7

Extending Horn clause theories by reflection principles

  • Sep 05, 1994
  • Stefania Costantini +2
  • Research Article
  • Citations11

Coinductive subtyping for abstract compilation of object-oriented languages into Horn formulas

  • Jun 09, 2010
  • Electronic Proceedings in Theoretical Computer Science
  • Davide Ancona +1
  • Book Chapter
  • Citations29

Some issues and trends in the semantics of logic programming

  • Jan 01, 1986
  • J Jaffar +2
  • Supplementary Content

Saturation-based Decision Procedures for Fixed Domain and Minimal Model Semantics

  • Jan 01, 2010
  • Publications of the UdS (Saarland University)
  • Matthias Horbach
  • Research Article
  • Citations4

On computability by logic programs

  • Sep 01, 1995
  • Annals of Mathematics and Artificial Intelligence
  • Andrei Voronkov
  • Book Chapter

A relational-functional integration for declarative programming

  • Jan 01, 1997
  • Harold Boley
  • Conference Article
  • Citations2

Certified Transformation for Static Single Assignment of SPMD Programs

  • Jun 01, 2014
  • Mohamed A El-Zawawy
  • Book Chapter
  • Citations34

Coinductive Type Systems for Object-Oriented Languages

  • Jan 01, 2009
  • Davide Ancona +1
  • Conference Article
  • Citations6

Complete coinductive subtyping for abstract compilation of object-oriented languages

  • Jun 22, 2010
  • Davide Ancona +1
  • Conference Article
  • Citations8

Interpreting programs in static single assignment form

  • Jun 07, 2004
  • Jeffery Von Ronne +2
  • Book Chapter
  • Citations1

Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas

  • Jan 01, 1999
  • Michael Dierkes
  • Research Article
  • Citations414

Rewrite-based Equational Theorem Proving with Selection and Simplification

  • Jan 01, 1994
  • Journal of Logic and Computation
  • Leo Bachmair +1
  • PDF
  • Dissertation
  • Citations1

Future value based single assignment program representations and optimizations

  • Jan 01, 2012
  • Shuhan Ding
  • Research Article
  • Citations8

A domain-theoretic approach to functional and logic programming

  • Jul 01, 1992
  • Journal of Functional Programming
  • Frank S K Silbermann +1
  • Research Article

Finding Regular Herbrand Models for CHCs using Answer Set Programming

  • Oct 29, 2025
  • Electronic Proceedings in Theoretical Computer Science
  • Gregoire Maire +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.