Mostafa Hassan
Artificial Intelligence · with Eilers · 2018
A researcher in the Science corpus: 1 paper; trusts 6 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 8 citations into it; #34,402 of 35,345 by trust here, #33,294 by citations
- Computational Theory and Mathematics — 5 citations into it
Whom Mostafa Hassan trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Mostafa Hassan overall
Papers from Mostafa Hassan's perspective
Ordered by how strongly the researchers Mostafa Hassan trusts endorse each paper. Same corpus, a different order for every researcher.
- Efficient E-Matching for SMT Solvers (CADE)
- Gradual Typing for Objects (European Conference on Object-Oriented Programming)
- The ins and outs of gradual type inference
- INTERPRETATION : ‘A UNIFIED LATTICE MODEL FOR STATIC ANALYSIS OF PROGRAMS BY CONSTRUCTION OR APPROXIMATION
- Dependent types and multi-monadic effects in F* (ACM-SIGACT Symposium on Principles of Programming Languages)
- Towards Type Inference for JavaScript
- Type Analysis for JavaScript
- Z3: An Efficient SMT Solver
- Maximum Satisfiability Using Core-Guided MaxSAT Resolution
- On the Complexity of Derivation in Propositional Calculus
Their papers
- MaxSMT-Based Type Inference for Python 3 (2018) — 55 citations