Model verification in lambda sigma : a type inference approach
Enrique V. Kortright · 1991
The author describes a number of model analysis and verification operations based on type inference in the lambda sigma simulation language. lambda sigma is a simulation language based on the typed lambda -calculus. lambda sigma entities correspond to typed lambda -expressions, while lambda sigma activities correspond to subtypes. Thus, entities can be generated by means of type-introduction rules, and operations can be defined on entities by means of type elimination and equality rules. Premises of the form e in tau in an introduction rule used to create a new entity can be satisfied by substituting for e any entity of type tau in a neighboring activity. It is then possible to perform a number of model analysis and verification operations using type inference algorithms available for the typed lambda -calculus.>