Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Principal Typings for Explicit Substitutions Daniel Lima Ventura1

Summary: Principal Typings for Explicit Substitutions
Daniel Lima Ventura1
, Mauricio Ayala-Rinc´on1
, and
Fairouz Kamareddine2
Grupo de Teoria da Computa¸c~ao, Dep. de Matem´atica Universidade de Bras´ilia,
Bras´ilia D.F., Brasil
School of Mathematical and Computer Sciences Heriot-Watt University,
Edinburgh, Scotland UK
{ventura,ayala}@mat.unb.br, fairouz@macs.hw.ac.uk
Abstract. Having principal typings (for short PT) is an important
property of type systems. In simply typed systems, this property guaran-
tees the possibility of a complete and terminating type inference mecha-
nism. It is well-known that the simply typed -calculus has this property
but recently J.B. Wells has introduced a system-independent definition
of PT, which allows to prove that some type systems, e.g. the Hind-
ley/Milner type system, do not satisfy PT. Explicit substitutions ad-


Source: Ayala-Rincón, Mauricio - Departamento de Matemática, Universidade de Brasília
Kamareddine, Fairouz - Computer Science Department, Heriot-Watt University


Collections: Computer Technologies and Information Sciences; Mathematics