Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Mathematical Logic (F.4.1) > AUTOMATH (F.4.1...)  
 
Options:
 
  1-1 of 1 Reviews about "AUTOMATH (F.4.1...)": Date Reviewed
  Semantics for classical AUTOMATH and related systems
Barendregt H. (ed), Rezus A. Information and Control 59(1-3): 127-147, 1984.  Type: Article

The AUTOMATH family of languages can be viewed as typed lambda-calculi. The type structures are parameterized and highly complex, as befits the fact that propositions are types, the elements of which are the proofs of that proposition....

Sep 1 1985
 
 
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy