2 papers
cs.FL2015
Regularity Preserving but not Reflecting Encodings
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
Encodings, that is, injective functions from words to words, have been studied extensively in several settings. In computability theory the notion of encoding is crucial for defini…
cs.LO2010
Modular Construction of Fixed Point Combinators and Clocked Boehm Trees
Joerg Endrullis, Dimitri Hendriks, Jan Willem Klop
Fixed point combinators (and their generalization: looping combinators) are classic notions belonging to the heart of lambda-calculus and logic. We start with an exploration of the…