Filtrer vos résultats
- 13
- 8
- 10
- 6
- 3
- 1
- 1
- 1
- 20
- 3
- 1
- 1
- 1
- 1
- 2
- 3
- 2
- 3
- 4
- 1
- 2
- 21
- 11
- 10
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 21
- 7
- 5
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
21 résultats
|
|
|
triés par
|
|
|
Models and theories of lambda calculus[Research Report] 2009
Rapport
inria-00380183v1
|
||
|
|
The fixed point property and a technique to harness double fixed point combinatorsJournal of Logic and Computation, 2019, 29 (5), pp.831-880. ⟨10.1093/logcom/exz013⟩
Article dans une revue
hal-02408192v1
|
||
A Relational Model of a Parallel and Non-deterministic lambda-CalculusLogical Foundations of Computer Science, International Symposium, LFCS 2009, Jan 2009, Deerfield Beach, FL, USA, France. pp.107-121
Communication dans un congrès
hal-00527245v1
|
|||
|
|
Strong Normalization of MLF via a Calculus of Coercions2010
Pré-publication, Document de travail
hal-00573697v1
|
||
A relational semantics of parallelism and non-determinism in a functional setting.Annals of Pure and Applied Logic, 2012, 163 (7), pp.918-934
Article dans une revue
inria-00628887v1
|
|||
Full Abstraction for Resource Calculus with TestsComputer Science Logic (CSL'11), Sep 2011, Bergen, Norway. pp.97-111, ⟨10.4230/LIPIcs.CSL.2011.97⟩
Communication dans un congrès
hal-00707814v1
|
|||
|
|
Not enough points is enoughComputer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Sep 2007, Lausanne, Switzerland. pp.298-312
Communication dans un congrès
hal-00148820v1
|
||
Full abstraction for a resource calculus with testsComputer Science Logic, 2011, Bergen, Norway. pp.97-111
Communication dans un congrès
inria-00628886v1
|
|||
Categorical Models for Simply Typed Resource Calculi26th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2010), May 2010, Ottawa, Canada. pp.213-230
Communication dans un congrès
hal-00527229v1
|
|||
|
|
New Results on Morris's Observational TheoryLeibniz International Proceedings in Informatics , 2016, 1st International Conference on Formal Structures for Computation and Deduction, pp.560. ⟨10.4230/LIPIcs.FSCD.2016.70⟩
Article dans une revue
hal-01337192v1
|
||
|
|
A relational semantics for parallelism and non-determinism in a functional settingAnnals of Pure and Applied Logic, 2012, 163 (7), pp.918-934. ⟨10.1016/j.apal.2011.09.008⟩
Article dans une revue
hal-00707776v1
|
||
The Fixed Point Property and a Technique to Harness Double Fixed Point Combinators2017
Pré-publication, Document de travail
hal-01672846v1
|
|||
|
|
Weighted Relational Models of Typed Lambda-Calculi28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013, Jun 2013, New Orleans, LA, United States. ⟨10.1109/LICS.2013.36⟩
Communication dans un congrès
hal-01144064v1
|
||
|
|
A relational model of a parallel and non-deterministic lambda-calculusLogical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings,, 2009, United States. pp.107-121
Communication dans un congrès
hal-00283095v2
|
||
|
|
Loader and Urzyczyn Are Logically RelatedICALP, 2012, Warwick, France. pp.364-376
Communication dans un congrès
hal-00959623v1
|
||
|
|
Lambda theories of effective lambda modelsCSL'07, 16th EACSL Annual Conference on Computer Science and Logic, Sep 2007, Lausanne, Switzerland. pp.268-282, ⟨10.1007/978-3-540-74915-8⟩
Communication dans un congrès
hal-00125816v2
|
||
|
|
Call-by-value non-determinism in a linear logic type disciplineLFCS - Logical Foundations of Computer Science - 2013, Jan 2013, San Diego, CA, United States. pp.164-178, ⟨10.1007/978-3-642-35722-0_12⟩
Communication dans un congrès
hal-00919463v1
|
||
|
|
Models and theories of lambda calculusLogic in Computer Science [cs.LO]. Université Paris-Diderot - Paris VII, 2008. English. ⟨NNT : ⟩
Thèse
tel-00715207v1
|
||
|
|
What is a categorical model of the differential and the resource lambda-calculi?2010
Pré-publication, Document de travail
hal-00493990v1
|
||
|
|
Relational Graph Models, Taylor Expansion and ExtensionalityElectronic Notes in Theoretical Computer Science, 2014, Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXX), 308, pp.45-272. ⟨10.1016/j.entcs.2014.10.014⟩
Article dans une revue
hal-01140878v1
|
||
|
|
Effective lambda-models vs recursively enumerable lambda-theoriesMathematical Structures in Computer Science, 2009, 19 (5), pp.897-942
Article dans une revue
hal-00288081v1
|