( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Type-based termination of recursive definitions.

, , , , и . Mathematical Structures in Computer Science, 14 (1): 97-141 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Tarmo Ploom

Osama Tarmoom

Tarmo Kulmar

Tarmo Sakari Luoma

Tarmo Sakari Luoma

 

Другие публикации лиц с тем же именем

Coinductive Big-Step Semantics for Concurrency.. PLACES, том 137 из EPTCS, стр. 63-78. (2013)Dependently typed programming with finite sets., и . WGP@ICFP, стр. 33-44. ACM, (2015)Container Combinatorics: Monads and Lax Monoidal Functors.. TTCS, том 10608 из Lecture Notes in Computer Science, стр. 91-105. Springer, (2017)Coinduction for Computation Structures and Programming Languages (NII Shonan Meeting 2013-11)., , и . NII Shonan Meet. Rep., (2013)Least and greatest fixed points in intuitionistic natural deduction., и . Theor. Comput. Sci., 272 (1-2): 315-339 (2002)Monad Translating Inductive and Coinductive Types.. TYPES, том 2646 из Lecture Notes in Computer Science, стр. 299-315. Springer, (2002)Decomposing Comonad Morphisms., и . CALCO, том 139 из LIPIcs, стр. 14:1-14:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Generalizing substitution.. FICS, том NS-02-2 из BRICS Notes Series, стр. 9-11. University of Aarhus, (2002)Quotienting the delay monad by weak bisimilarity., , и . Math. Struct. Comput. Sci., 29 (1): 67-92 (2019)Generalizing Substitution.. RAIRO Theor. Informatics Appl., 37 (4): 315-336 (2003)