Name
Abstract | ||
|---|---|---|
Many features of current logic programming languages are not captured by conventional semantics. Their fundamentally non-ground character, and the uniform way in which such languages have been extended to typed domains subject to constraints, suggest that a categorical treatment of constraint domains, of programming syntax and of semantics may be closer in spirit to declarative programming than conventional set theoretic semantics. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/BFb0022261 | CSL |
Keywords | Field | DocType |
tau categories,logic programming,declarative programming | Procedural programming,Functional logic programming,Fifth-generation programming language,Programming language,Programming paradigm,Computer science,Inductive programming,Constraint programming,Theoretical computer science,Declarative programming,Logic programming | Conference |
Volume | ISSN | ISBN |
933 | 0302-9743 | 3-540-60017-5 |
Citations | PageRank | References |
7 | 0.56 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stacy E. Finkelstein | 1 | 16 | 1.78 |
| Peter J. Freyd | 2 | 91 | 16.54 |
| James Lipton | 3 | 7 | 0.56 |