Type Inference for First-Order Logic

Authors:
Aleksy Schubert
Affiliations:
-
Venue:
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Year:
2000

Citing 4
Cited 0

Logic programming in the LF logical framework

Logical frameworks
Second-order unification and type inference for Church-style polymorphism

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Undecidability of Typability in the Lambda-Pi-Calculus

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Proof-Search in Intuitionistic Logic Based on Constraint Satisfaction

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although type inference for dependent types is in general undecidable, people experience that the algorithms for type inference in Elf programming language stop in common cases. The present paper is a partial explanation of this behaviour. It shows that for a wide range of terms -- terms that correspond to first-order logic proofs -- the formalism of dependent types gives decidable type inference. We remark also that imposing that the context and the type of a judgement are first-order is not sufficient for obtaining decidability.