2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.LO2017
Intensional Constructed Numbers: Towards Formalizing the Notion of Algorithm
Fritz Müller
This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead o…
cs.LO2008★ 2 cited
Full Abstraction for a Recursively Typed Lambda Calculus with Parallel Conditional
Fritz Müller
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. W…