| Vincent van Oostrom. Lambda calculus with patterns. Technical Report IR 228, Vrile Universiteit, Amsterdam, November 1990. |
....to patternmatching constructs, but the resulting syntax does not allow nested patterns as generalizations of variables. Gallier [8] gives a novel term assignment to sequent proofs and describes the cut elimination rules on it, but his syntax also does not build nested patterns. Van Oostrom [20] studies a lambda calculus with patterns which are arbitrary lambda terms. The idea of reducing inside a pattern is a very interesting but radical departure from programming language practice and it leads to many technical difficulties. Unilluminating restrictions must be applied to obtain ....
V. van Oostrom. Lambda calculus with patterns. IR 228, Vrije Universiteit, Amsterdam, November 1990.
....and product patterns. These pattern constructors allow to make abstractions of functions not only with respect to variables, but also with respect to patterns, specifying in this way the form of the arguments of a function. Other formalisms for calculi with nested patterns can be found in [vO90, Jon87, How92, BTKP93]. In particular, the LWPP calculus can also be viewed as a sub calculus of the Typed Pattern Calculus (TPC) that was recently proposed in [BTKP93] More precisely, the LWPP calculus can be encoded in the TPC following standard techniques: this last one is designed in the spirit of the Curry Howard ....
Vincent van Oostrom. Lambda calculus with patterns. Technical Report IR 228, Vrije Universiteit, Amsterdam, November 1990.
No context found.
Vincent van Oostrom. Lambda calculus with patterns. Technical Report IR 228, Vrile Universiteit, Amsterdam, November 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC