Abstract | ||
---|---|---|
Some cases of solvability of the convertibility equation MX=N, where M,N and X are normal forms of the λ-K-β-calculus are considered and their relationship to pattern-matching problems is discussed. In particular, the solvability of such an equation is decided in the cases: |
Year | DOI | Venue |
---|---|---|
1974 | 10.1007/3-540-06841-4_60 | ICALP |
Keywords | Field | DocType |
normal forms,for this purpose,a polynomial representation and subsequently a tree representation of normal forms are introduced.,combinatorial problems,combinator equations,normal form,pattern matching | Discrete mathematics,Combinatorics,Tree representation,Combinatory logic,Combinatorial principles,A-normal form,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-06841-4 | 10 | 5.53 |
References | Authors | |
2 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Corrado Böhm | 1 | 487 | 413.44 |
Mariangiola Dezani-Ciancaglini | 2 | 1615 | 193.57 |