Filtrer vos résultats
- 22
- 1
- 15
- 5
- 3
- 15
- 23
- 6
- 7
- 8
- 1
- 1
- 20
- 3
- 23
- 1
- 7
- 4
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
23 résultats
|
|
|
triés par
|
|
|
Extension of ML type system with a sorted equation theory on types[Research Report] RR-1766, INRIA. 1992
Rapport
inria-00077006v1
|
||
|
|
Parser in ML[Research Report] RR-1659, INRIA. 1992
Rapport
inria-00074898v1
|
||
|
|
Extraction de programmes dans le Calcul des ConstructionsGénie logiciel [cs.SE]. Université Paris-Diderot - Paris VII, 1989. Français. ⟨NNT : ⟩
Thèse
tel-00431825v1
|
||
|
|
The Gilbreath trick : a case study in axiomatisation and proof development in the Coq proof assistant[Research Report] RR-1511, INRIA. 1991
Rapport
inria-00075051v1
|
||
|
|
Efficient data representation in polymorphic languagesPLILP 1990: Programming Language Implementation and Logic Programming, Aug 1990, Linköping, Sweden. ⟨10.1007/BFb0024189⟩
Communication dans un congrès
hal-01499983v1
|
||
|
|
Type inference for records in a natural extension of ML[Research Report] RR-1431, INRIA. 1991
Rapport
inria-00075129v1
|
||
|
|
Dynamics in ML[Research Report] RR-1491, INRIA. 1991
Rapport
inria-00075071v1
|
||
|
|
An Analysis of Bohm's theorem[Research Report] RR-2008, INRIA. 1993
Rapport
inria-00074664v1
|
||
|
|
Démonstration Automatique dans le Calcul des ConstructionsInformatique [cs]. Université de Paris 7 - Denis Diderot, 1991. Français. ⟨NNT : ⟩
Thèse
tel-04201468v1
|
||
|
|
Extending record typing to type parametric modules with sharing[Research Report] RR-1905, INRIA. 1993
Rapport
inria-00074768v1
|
||
|
|
Typage polymorphe d'un langage algorithmiqueLangage de programmation [cs.PL]. Université Paris 7, 1992. Français. ⟨NNT : ⟩
Thèse
tel-01499951v1
|
||
|
|
Polymorphic type inference and assignmentPOPL 1991: 18th symposium Principles of Programming Languages, ACM, Jan 1991, Orlando, United States. pp.291-302, ⟨10.1145/99583.99622⟩
Communication dans un congrès
hal-01499974v1
|
||
|
|
Dynamics in MLFPCA 1991: Functional Programming Languages and Computer Architecture, Aug 1991, Boston, United States. pp.406-426
Communication dans un congrès
hal-01499984v1
|
||
|
|
A Second-order pattern matching algorithm for the cube of typed lambda-calculi[Research Report] RR-1585, INRIA. 1992
Rapport
inria-00074975v1
|
||
|
|
Extending record typing to type parametric modules with sharingthe 20th ACM SIGPLAN-SIGACT symposium, 1993, Charleston, United States. pp.465-478, ⟨10.1145/158511.158704⟩
Communication dans un congrès
hal-02455776v1
|
||
|
|
Residual theory in lambda-calculus : a formal development[Research Report] RR-2009, INRIA. 1993
Rapport
inria-00074663v1
|
||
|
|
Statically typed friendly functions via partially abstract types[Research Report] RR-1899, INRIA. 1993
Rapport
inria-00074772v1
|
||
|
|
Syntactic theories and the algebra of record terms[Research Report] RR-1869, INRIA. 1993
Rapport
inria-00074804v1
|
||
|
|
On the unity of logic[Research Report] RR-1467, INRIA. 1991
Rapport
inria-00075095v1
|
||
|
|
A New constructive logic : classical logic[Research Report] RR-1443, INRIA. 1991
Rapport
inria-00075117v1
|
||
|
|
Polymorphic typing of an algorithmic language[Research Report] RR-1778, INRIA. 1992
Rapport
inria-00077018v1
|
||
|
|
Typing record concatenation for free[Research Report] RR-1739, INRIA. 1992
Rapport
inria-00076978v1
|
||
|
|
Unboxed objects and polymorphic typingPOPL 1992: 19th symposium Principles of Programming Languages, Jan 1992, Albuquerque, United States. pp.177-188, ⟨10.1145/143165.143205⟩
Communication dans un congrès
hal-01499973v1
|