General Recursion and Formal Topology

Details General Recursion and Formal Topology General Recursion and Formal Topology

2010-12-22

arxiv.org/abs/1012.4899v1

EPTCS 43, 2010, pp. 65-75

Computer Science

Logic in Computer Science

In Proceedings PAR 2010, arXiv:1012.4555

Scientific paper

10.4204/EPTCS.43.5

It is well known that general recursion cannot be expressed within
Martin-Loef's type theory and various approaches have been proposed to overcome
this problem still maintaining the termination of the computation of the
typable terms. In this work we propose a new approach to this problem based on
the use of inductively generated formal topologies.

Affiliated with

Also associated with

No associations

Rating

General Recursion and Formal Topology 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 General Recursion and Formal Topology, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and General Recursion and Formal Topology will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-581947