Entailment of NonStructural Subtype Constraints
| Title: | Entailment of NonStructural Subtype Constraints |
|---|---|
| Authors: | Joachim Niehren; Tim Priesnitz; Programming Systems Lab; |
| Contributors: | The Pennsylvania State University CiteSeerX Archives |
| Source: | http://www.ps.uni-sb.de/Papers/abstracts/SubTypeEntailment:99.ps. |
| Publisher Information: | Springer |
| Publication Year: | 1999 |
| Collection: | CiteSeerX |
| Description: | \Sigma of function symbols(i.e. a ground term over \Sigma). A recursive type is an infinite tree over \Sigma. Most typically, \Sigma contains the constants int and real and the binary function symbol \Theta for pairing.The type of a pair of integers, for instance, is the finite tree int |
| Document Type: | text |
| File Description: | application/postscript |
| Language: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.8346 |
| Availability: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.8346; http://www.ps.uni-sb.de/Papers/abstracts/SubTypeEntailment:99.ps |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Accession Number: | edsbas.DD5C3AEC |
| Database: | BASE |