• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Formal Verification of Concurrent Programs Based on Type Theory (1998)

by Shen-Wei Yu
Add To MetaCart

Tools

Sorted by:
Results 1 - 1 of 1

Lego and Related Work

by Zhaohui Luo , 1999
"... ence card): -- \Pi-types, -abstraction and applications: fx:AgB, A-?B, [x:A]b, (f a). -- Inductive types: macro Inductive with options such as Theorems, Relation, Inversion, Double, etc. For example (also see examples like the less-than relation in exercises): Inductive [List : Type] Theorems P ..."
Abstract - Add to MetaCart
ence card): -- \Pi-types, -abstraction and applications: fx:AgB, A-?B, [x:A]b, (f a). -- Inductive types: macro Inductive with options such as Theorems, Relation, Inversion, Double, etc. For example (also see examples like the less-than relation in exercises): Inductive [List : Type] Theorems Parameters [A : Type] Constructors [nil : List] [cons : A-?List-?List]; Lecture notes for Types Summer School'99: Theory and Practice of Formal Proofs, Giens, France, 1999. 1 -- Predicative universes (with `typical ambiguity'): Type(i), Type. -- Logical universe (impredicative, giving HOL): Prop. -- Local definitions: [x=a]b. -- Argument synthesis: fx---A
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University