Strategies for Solving Constraints in Type and Effect Systems

Authors:
Jurriaan Hage;Bastiaan Heeren
Affiliations:
Department of Information and Computing Sciences, Universiteit Utrecht P.O.Box 80.089, 3508 TB Utrecht, The Netherlands;Faculty of Computer Science, Open Universiteit Nederland
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 11
Cited 1

Proofs about a folklore let-polymorphic type inference algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Types and programming languages

Types and programming languages
Principles of Program Analysis

Principles of Program Analysis
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Type-Based Approach to Program Security

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Explaining Type Errors by Finding the Source of a Type Conflict

SFP '99 Selected papers from the 1st Scottish Functional Programming Workshop (SFP99)
On the Unification of Substitutions in Type Interfaces

IFL '98 Selected Papers from the 10th International Workshop on 10th International Workshop
Helium, for learning Haskell

Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
TinkerType: a language for playing with formal systems

Journal of Functional Programming
Ruler: programming type rules

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming

Improving type error messages for generic Java

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Turning type and effect deduction systems into an algorithm is a tedious and error-prone job, and usually results in an implementation that leaves no room to modify the solving strategy, without actually changing it. We employ constraints to declaratively specify the rules of a type system. Starting from a constraint based formulation of a type system, we introduce special combinators in the type rules to specify in which order constraints may be solved. A solving strategy can then be chosen by giving a particular interpretation to these combinators, and the resulting list of constraints can be fed into a constraint solver; thus the gap between the declarative specification and the deterministic implementation is bridged. This design makes the solver simpler and easier to reuse. Our combinators have been used in the development of a real-life compiler.