Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Jerzy Tiuryn - MaRDI portal

Jerzy Tiuryn

From MaRDI portal
(Redirected from Person:1185004)
Person:801683

Available identifiers

zbMath Open tiuryn.jerzyDBLPt/JerzyTiurynWikidataQ26693952 ScholiaQ26693952MaRDI QIDQ801683

List of research outcomes





PublicationDate of PublicationType
Phylogenetic network-assisted rooting of unrooted gene trees2024-11-28Paper
Rooting gene trees via phylogenetic networks2023-08-10Paper
Untyped lambda-calculus with input-output2023-02-23Paper
Type reconstruction with recursive types and atomic subtyping2022-11-02Paper
Substructural logic and partial correctness2017-06-13Paper
Equational axiomatization of bicoercibility for polymorphic types2017-01-19Paper
SIZE DISTRIBUTION OF GENE FAMILIES IN A GENOME2014-05-16Paper
Inferring Evolutionary Scenarios in the Duplication, Loss and Horizontal Gene Transfer Model2012-07-16Paper
https://portal.mardi4nfdi.de/entity/Q54571382008-04-14Paper
On Genome Evolution with Innovation2007-09-05Paper
A DISCRETE MODEL OF EVOLUTION OF SMALL PARALOG FAMILIES2007-08-01Paper
A model for the evolution of paralog families in genomes2007-06-12Paper
Comparative Genomics2006-10-19Paper
DLS-trees: a model of evolutionary scenarios2006-09-14Paper
Types for Proofs and Programs2005-12-23Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
https://portal.mardi4nfdi.de/entity/Q48231402004-10-26Paper
https://portal.mardi4nfdi.de/entity/Q47894452003-01-29Paper
Alpha-conversion and typability2003-01-14Paper
Discrimination by parallel observers: the algorithm.2003-01-14Paper
A sequent calculus for subtyping polymorphic types2003-01-14Paper
On the completeness of propositional Hoare logic2002-06-23Paper
The subtyping problem for second-order types is undecidable.2002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31462722002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q27578502001-12-04Paper
https://portal.mardi4nfdi.de/entity/Q45257812001-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49418482000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q43855401998-05-14Paper
https://portal.mardi4nfdi.de/entity/Q43645051998-04-15Paper
https://portal.mardi4nfdi.de/entity/Q43758031998-02-08Paper
https://portal.mardi4nfdi.de/entity/Q43324221997-06-03Paper
An analysis of ML typability1995-02-13Paper
https://portal.mardi4nfdi.de/entity/Q42814771994-03-10Paper
The undecidability of the semi-unification problem1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40276301993-02-21Paper
Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus1992-09-27Paper
On the expressive power of finitely typed and universally polymorphic recursive procedures1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39760291992-06-26Paper
Fixed points in free process algebras. II1990-01-01Paper
A simplified proof of \(DDL<DL\)1989-01-01Paper
Fixed points in free process algebras. I1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30333181989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32040251989-01-01Paper
Some relationships between logics of programs and complexity theory1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37766071987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37368981986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859011986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36786511985-01-01Paper
Equivalences among logics of programs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33457721984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36786641984-01-01Paper
Unbounded program memory adds to the expressive power of first-order programming logic1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51867281984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33165841983-01-01Paper
Floyd's principle, correctness theories and program equivalence1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33277061982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39579271982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39684541982-01-01Paper
Another incompleteness result for Hoare's logic1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39221581981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39471051981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39485781981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39538241981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39601421981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47458151981-01-01Paper
Unique fixed points vs. least fixed points1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38787411980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39384901980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38515881979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38770271979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39063951979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39084581979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39084591979-01-01Paper
Some results on the decomposition of finite automata1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39174901978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41647811978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41858361978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41316801977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41330891977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41365721977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41742131977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41813031977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41063701976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40944051975-01-01Paper

Research outcomes over time

This page was built for person: Jerzy Tiuryn