Extensional Collapse Situations I: non-termination and unrecoverable errors

Details Extensional Collapse Situations I: non-termination and unrecoverable errors Extensional Collapse Situations I: non-termination and unrecoverable errors

2011-01-24

arxiv.org/abs/1101.4465v1

Computer Science

Logic in Computer Science

Scientific paper

We consider a simple model of higher order, functional computation over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable errors, taken separately or jointly. We show that the models so defined form a lattice when ordered by the extensional collapse situation relation, introduced in order to compare models with respect to the amount of "intensional information" that they provide on computation. The proofs are carried out by exhibiting suitable applied {\lambda}-calculi, and by exploiting the fundamental lemma of logical relations.

Affiliated with

Also associated with

No associations

Rating

Extensional Collapse Situations I: non-termination and unrecoverable errors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extensional Collapse Situations I: non-termination and unrecoverable errors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extensional Collapse Situations I: non-termination and unrecoverable errors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-636086