# A Step-indexed Semantic Model of Types for the Call-by-Name Lambda Calculus

@article{Meurer2011ASS, title={A Step-indexed Semantic Model of Types for the Call-by-Name Lambda Calculus}, author={Benedikt Meurer}, journal={ArXiv}, year={2011}, volume={abs/1105.1985} }

Step-indexed semantic models of types were proposed as an alternative to purely syntactic safety proofs using subject-reduction. Building upon the work by Appel and others, we introduce a generalized step-indexed model for the call-by-name lambda calculus. We also show how to prove type safety of general recursion in our call-by-name model.

#### Citations

##### Publications citing this paper.

## Step-indexed models of call-byname : a tutorial example

VIEW 1 EXCERPT

CITES METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 13 REFERENCES

## A Step-indexed Semantics of Imperative Objects

VIEW 1 EXCERPT

## A lambda calculus of objects and method specialization

VIEW 1 EXCERPT

## Syntactic considerations on recursive types

VIEW 1 EXCERPT

## A Syntactic Approach to Type Soundness

VIEW 1 EXCERPT

## An indexed model of recursive types for foundational proof-carrying code

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## A Theory of Objects

VIEW 1 EXCERPT

## What is a recursive module?

VIEW 1 EXCERPT