Daniel Fridlender

According to our database1, Daniel Fridlender authored at least 11 papers between 1996 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Understanding Lua's Garbage Collection: Towards a Formalized Static Analyzer.
Proceedings of the PPDP '20: 22nd International Symposium on Principles and Practice of Declarative Programming, 2020

2017
Biorthogonality for a Lazy language.
Proceedings of the 29th Symposium on Implementation and Application of Functional Programming Languages, 2017

Decoding Lua: formal semantics for the developer and the semanticist.
Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages, Vancouver, BC, Canada, October 23, 2017

2015
Pure type systems with explicit substitutions.
J. Funct. Program., 2015

Proving Correctness of a Compiler Using Step-indexed Logical Relations.
Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015

2013
A Certified Extension of the Krivine Machine for a Call-by-Name Higher-Order Imperative Language.
Proceedings of the 19th International Conference on Types for Proofs and Programs, 2013

A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation.
Proceedings of the Typed Lambda Calculi and Applications, 11th International Conference, 2013

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

2000
Do we need dependent types?
J. Funct. Program., 2000

1998
An Interpretation of the Fan Theorem in Type Theory.
Proceedings of the Types for Proofs and Programs, 1998

1996
Highman's Lemma in theory.
Proceedings of the Types for Proofs and Programs, 1996


  Loading...