Théorie type And NotJ. L. Caldwell
List of bibliographic references
Number of relevant bibliographic references: 11.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000343 | Mathieu Turuani [France] | The CL-atse protocol analyser |
| 000354 | Dominique Colnet [France] ; Guillem Marpons [Espagne] ; Frederic Merizen [France] | Reconciling subtyping and code reuse in object-oriented languages : Using inherit and insert in smarteiffel, the GNU eiffel compiler |
| 000417 | Franz Baader [Allemagne] ; Silvio Ghilardi [Italie] ; Cesare Tinelli [États-Unis] | A new combination procedure for the word problem that generalizes fusion decidability results in modal logics |
| 000476 | Francois Lamarche [France] ; Lutz Strassburger [Allemagne] | Naming proofs in classical propositional logic |
| 000504 | Frédéric Blanqui [France] | Decidability of type-checking in the calculus of algebraic constructions with size annotations |
| 000574 | Horatiu Cirstea [France] ; Luigi Liquori [France] ; Benjamin Wack [France] | Rewriting calculus with fixpoints: Untyped and first-order systems |
| 000696 | Alberto Ciaffaglione [Italie] ; Luigi Liquori [France] ; Marino Miculan [Italie] | Imperative object-based calculi in co-inductive type theories |
| 000877 | Horatiu Cirstea [France] ; Claude Kirchner [France] ; Luigi Liquori [France] | The Rho cube |
| 000963 | A. Felty [États-Unis] | The calculus of constructions as a framework for proof search with set variable instantiation |
| 000974 | D. Galmiche [France] ; D. J. Pym [Royaume-Uni] | Proof-search in type-theoretic languages : an introduction |
| 000976 | M. W. Bunder [Australie] | Proof finding algorithms for implicational logics |
| This area was generated with Dilib version V0.6.33. |  |