Finiteness and rational sequences, constructively*
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Functional Programming"
DOI: 10.1017/s0956796817000041
Abstract: Abstract Rational sequences are possibly infinite sequences with a finite number of distinct suffixes. In this paper, we present different implementations of rational sequences in Martin–Löf type theory. First, we literally translate the above definition… read more here.
Keywords: finiteness rational; lists backpointers; type theory; sequences constructively ... See more keywords