Filtrer vos résultats
- 13
- 1
- 1
- 9
- 5
- 1
- 1
- 14
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 2
- 1
- 2
- 3
- 15
- 15
- 1
- 1
- 1
- 1
- 15
- 6
- 4
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
15 résultats
|
|
triés par
|
|
On sharing, memoization, and polynomial timeInformation and Computation, 2018, 261, pp.3 - 22. ⟨10.1016/j.ic.2018.05.003⟩
Article dans une revue
hal-01926431v1
|
||
|
TcT: Tyrolean Complexity ToolProceedings of 22nd TACAS, Apr 2016, Eindhoven, Netherlands. pp.407-423, ⟨10.1007/978-3-662-49674-9_24⟩
Communication dans un congrès
hal-01392188v1
|
||
|
On probabilistic term rewritingScience of Computer Programming, 2020, 185, pp.102338. ⟨10.1016/j.scico.2019.102338⟩
Article dans une revue
hal-02381877v1
|
||
|
On continuation-passing transformations and expected cost analysisProceedings of the ACM on Programming Languages, 2021, 5 (ICFP), pp.1 - 30. ⟨10.1145/3473592⟩
Article dans une revue
hal-03338493v1
|
||
|
Analysing the Complexity of Functional Programs: Higher-Order Meets First-OrderICFP 2015, Aug 2015, Vancouver, Canada. ⟨10.1145/2784731.2784753⟩
Communication dans un congrès
hal-01231809v1
|
||
|
Type-Based Complexity Analysis of Probabilistic Functional Programs (Technical Report)[Research Report] INRIA Sophia Antipolis; University of Bologna; ENS Lyon. 2019
Rapport
hal-02103943v1
|
||
|
Automated Expected Value Analysis of Recursive ProgramsProceedings of the ACM on Programming Languages, 2023, 7 (PLDI), pp.1050-1072. ⟨10.1145/3591263⟩
Article dans une revue
hal-04345663v1
|
||
|
Type-Based Complexity Analysis of Probabilistic Functional ProgramsLICS 2019 - 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1-13, ⟨10.1109/LICS.2019.8785725⟩
Communication dans un congrès
hal-02381829v1
|
||
|
Complexity of Acyclic Term Graph RewritingProceedings of FSCD'16, Jun 2016, Porto, Portugal. ⟨10.4230/LIPIcs.FSCD.2016⟩
Communication dans un congrès
hal-01336582v1
|
||
|
Certification of Complexity Proofs using CeTA26th International Conference on Rewriting Techniques and Applications, Jun 2015, Warsaw, Poland. ⟨10.4230/LIPIcs.RTA.2015.23⟩
Communication dans un congrès
hal-01252000v1
|
||
|
On Sharing, Memoization, and Polynomial TimeProceedings of STACS 2015, 2015, Munich, Germany. ⟨10.4230/LIPIcs.STACS.2015.62⟩
Communication dans un congrès
hal-01231816v1
|
||
|
On Probabilistic Term RewritingFunctional and Logic Programming - 14th International Symposium, Proceedings, May 2018, Nagoya, Japan
Communication dans un congrès
hal-01926502v1
|
||
|
Automating sized-type inference for complexity analysisProceedings of the ACM on Programming Languages, 2017, 1 (ICFP), pp.1 - 29. ⟨10.1145/3110287⟩
Article dans une revue
hal-01639200v1
|
||
|
Quantum Expectation Transformers for Cost AnalysisSymposium on Logic In Computer Science LICS ’22, Aug 2022, Haifa, Israel
Communication dans un congrès
hal-03540366v1
|
||
|
A Modular Cost Analysis for Probabilistic ProgramsOOPSLA 2020 - Conference on Object-oriented Programming, Systems, Languages, and Applications part of SPLASH 2020, Nov 2020, Chicago / Online, United States
Communication dans un congrès
hal-03013544v1
|