Source-tracking unification
From MaRDI portal
Publication:2568436
Recommendations
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- A theory of type polymorphism in programming
- An almost linear Robinson unification algorithm
- An Efficient Unification Algorithm
- Complete Sets of Reductions for Some Equational Theories
- Compositional explanation of types and algorithmic debugging of type errors
- Discriminative sum types locate the source of type errors
- Efficiency of a Good But Not Linear Set Union Algorithm
- Explaining type inference
- Formal-Language-Constrained Path Problems
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 592368 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- scientific article; zbMATH DE number 1956560 (Why is no real title available?)
- scientific article; zbMATH DE number 1407672 (Why is no real title available?)
- scientific article; zbMATH DE number 3395362 (Why is no real title available?)
- Implementation of Functional Languages
- Interconvertibility of a class of set constraints and context-free-language reachability
- Linear unification
- Maximal unifiable subsets and minimal non-unifiable subsets
- On determining the causes of nonunifiability
- On the logic of unification
- Origin tracking
- Program Slicing
- Scripting the type inference process
- Source-tracking unification.
- Unification: a multidisciplinary survey
This page was built for publication: Source-tracking unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568436)