"Mechanising lambda-calculus using a classical first order theory of terms ..."

Michael Norrish (2006)

> Home

Details and statistics

DOI: 10.1007/S10990-006-8745-7

access: closed

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/lisp/Norrish06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/lisp/Norrish06
Michael Norrish:
Mechanising lambda-calculus using a classical first order theory of terms with permutations. High. Order Symb. Comput. 19(2-3): 169-195 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.