Database programming in Machiavelli—a polymorphic language with static type inference

Type Inference in the Icon Programming Language

Static Type Inference for a First-Order Declarative Visual Programming Language with Inheritance

ion boxes referencing Y are already ‘safe’ from type errors because their definitions and properties prevent impersonations: assignments of invalid types into an abstraction box. Hence, it is not necessary to propagate requirements from abstraction boxes that reference Y into the requirements of Y, and such references can simply be ignored in the requirements axiom. Taking advantage of this fac...

A Bottom-Up Polymorphic Type Inference in Logic Programming

Barbuti, R. and R. Giacobazzi, A bottom-up polymorphjc type inference in logic programming, Science of Computer Programming 19 (1992) 281-313. We present a type inference system for Horn clause logic programs, based on a bottom-up abstract interpretation technique. Through the definition of suitable abstract operators, we obtain an abstract immediate consequence operator map associated with the...

Polymorphic Type Inference in Scheme

This paper presents a type-inference system for Scheme that is designed to be used by students in an introductory programming course. The major goal of the work is to present a simple type inference system that can be used by beginning students, yet is powerful enough to express the ideas of types, polymorphism, abstract data types (ADTs), and higher-order procedures. The system also performs s...

A Semantics for Static Type Inference in a Nondeterministic Language

Plotkin used the models of reduction in order to obtain a semantic characterization of static type inference in the pure-calculus. Here we apply these models to the study of a nondeterministic language, obtaining results analogous to Plotkin's.