Highman's Lemma in theory. - Daniel Fridlender (TYPES, 1996)

An Interpretation of the Fan Theorem in Type Theory. - Daniel Fridlender (TYPES, 1998)

Do we need dependent types? - Daniel Fridlender; Mia Indrika (J. Funct. Program., 2000)

A Proof-Irrelevant Model of Martin-Löf's Logical Framework. - Daniel Fridlender (Math. Struct. Comput. Sci., 2002)

A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation. - Daniel Fridlender; Miguel Pagano (TLCA, 2013)

A Certified Extension of the Krivine Machine for a Call-by-Name Higher-Order Imperative Language. - Leonardo Rodríguez; Daniel Fridlender; Miguel Pagano (TYPES, 2013)

Proving Correctness of a Compiler Using Step-indexed Logical Relations. - Leonardo Rodríguez; Miguel Pagano; Daniel Fridlender (LSFA, 2015)

Pure type systems with explicit substitutions. - Daniel Fridlender; Miguel Pagano (J. Funct. Program., 2015)

Decoding Lua: formal semantics for the developer and the semanticist. - Mallku Soldevila; Beta Ziliani; Bruno Silvestre; Daniel Fridlender; Fabio Mascarenhas (DLS, 2017)

Biorthogonality for a Lazy language. - Daniel Fridlender; Alejandro Gadea; Miguel Pagano; Leonardo Rodríguez (IFL, 2017)

Understanding Lua's Garbage Collection: Towards a Formalized Static Analyzer. - Mallku Soldevila; Beta Ziliani; Daniel Fridlender (PPDP, 2020)