Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A bottom-up polymorphic type inference in logic programming

From MaRDI portal
Publication:1208426
Jump to:navigation, search

DOI10.1016/0167-6423(92)90038-DzbMath0774.68024MaRDI QIDQ1208426

Roberto Giacobazzi, Roberto Barbuti

Publication date: 16 May 1993

Published in: Science of Computer Programming (Search for Journal in Brave)


zbMATH Keywords

abstract interpretationHorn clause logictype inference system


Mathematics Subject Classification ID

Logic programming (68N17) General topics in the theory of software (68N01)


Related Items (7)

Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Data type inference for logic programming ⋮ Unnamed Item ⋮ A polymorphic type dependency analysis for logic programs ⋮ Improving precision of type analysis using non-discriminative union ⋮ Extending Constructive Logic Negation with Types ⋮ Type dependencies for logic programs using ACI-unification






This page was built for publication: A bottom-up polymorphic type inference in logic programming

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1208426&oldid=13272035"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki