Travelled to:
1 × Canada
1 × China
1 × Italy
1 × USA
1 × United Kingdom
Collaborated with:
T.Rompf M.Odersky R.Tate K.R.M.Leino G.Kossakowski A.K.Sujeeth K.J.Brown V.Jovanovic H.Lee M.Jonnalagedda K.Olukotun
Talks about:
type (5) interpret (2) program (2) verifi (2) system (2) depend (2) compil (2) sound (2) javascript (1) existenti (1)
Person: Nada Amin
DBLP: Amin:Nada
Contributed to:
Wrote 10 papers:
- ICFP-2015-RompfA #c #compilation #functional #sql
- Functional pearl: a SQL to C compiler in 500 lines of code (TR, NA), pp. 2–9.
- OOPSLA-2014-AminRO #dependent type
- Foundations of path-dependent types (NA, TR, MO), pp. 233–249.
- TAP-2014-AminLR #smt
- Computing with an SMT Solver (NA, KRML, TR), pp. 20–35.
- POPL-2013-RompfSABJLJOO #compilation #data type #optimisation #source code #staging
- Optimizing data structures in high-level programs: new directions for extensible compilers based on staging (TR, AKS, NA, KJB, VJ, HL, MJ, KO, MO), pp. 497–510.
- ECOOP-2012-KossakowskiARO #domain-specific language #embedded #javascript
- JavaScript as an Embedded DSL (GK, NA, TR, MO), pp. 409–434.
- OOPSLA-2016-AminT #java #null #pointer #scala #type system
- Java and scala's type systems are unsound: the existential crisis of null pointers (NA, RT), pp. 838–848.
- OOPSLA-2016-RompfA
- Type soundness for dependent object types (DOT) (TR, NA), pp. 624–641.
- POPL-2017-AminR #proving
- Type soundness proofs with definitional interpreters (NA, TR), pp. 666–679.
- POPL-2017-AminR17a #abstraction #named #programming
- LMS-Verify: abstraction without regret for verified systems programming (NA, TR), pp. 859–873.
- POPL-2018-AminR
- Collapsing towers of interpreters (NA, TR), p. 33.