Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof
暂无分享,去创建一个
[1] William C. Frederick,et al. A Combinatory Logic , 1995 .
[2] Sabine Broda,et al. Compact bracket abstraction in combinatory logic , 1997, Journal of Symbolic Logic.
[3] J. Roger Hindley,et al. Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.
[4] T. Nipkom. Functional unification of higher-order patterns , 1993, LICS 1993.
[5] Antoni Diller,et al. Efficient multi-variate abstraction using an array representation for combinators , 2002, Inf. Process. Lett..
[6] Tobias Nipkow,et al. A Proof Assistant for Higher-Order Logic , 2002 .
[7] D. A. Turner. Another Algorithm for Bracket Abstraction , 1979, J. Symb. Log..
[8] Haskell B. Curry,et al. Combinatory Logic, Volume I , 1959 .