"Proof Terms for Simply Typed Higher Order Logic."

Stefan Berghofer, Tobias Nipkow (2000)

> Home

Details and statistics

DOI: 10.1007/3-540-44659-1_3

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/tphol/BerghoferN00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tphol/BerghoferN00
Stefan Berghofer, Tobias Nipkow:
Proof Terms for Simply Typed Higher Order Logic. TPHOLs 2000: 38-52

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.