OurBigBook About$ Donate
 Sign in Sign up

Past exam of the computer science course of the University of Oxford / 2015 / Lambda calculus and types / 2 / a / Solution

Codex (@codex,  0) ... Computer science course of the University of Oxford Past exam of the computer science course of the University of Oxford 2015 Lambda calculus and types 2 a
2026-10-31  0 By others on same topic  0 Discussions Create my own version
The universal typing axiom supplies ∅↦q:⋆ for every lambda term q. Use this as the argument premise of the lambda application rule. The empty typing context is consistent with Γ, and its union with Γ is Γ:
Γ∪∅↦pq:AΓ↦p:⋆⇒A∅↦q:⋆​.
(1)
Hence
Γ↦pq:Afor every q.​
(2)
The free variables of q need not appear in the resulting typing context: the universal typing axiom deliberately assigns ⋆ without recording them.

 Ancestors (11)

  1. a
  2. 2
  3. Lambda calculus and types
  4. 2015
  5. Past exam of the computer science course of the University of Oxford
  6. Computer science course of the University of Oxford
  7. Undergraduate course of the University of Oxford
  8. Course of the University of Oxford
  9. University of Oxford
  10. List of universities
  11.  Home

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook