Difference between revisions of "Jim Newton"
|Line 11:||Line 11:|
That's me in the center, between my brother and cousin. We're eating watermelon at my
That's me in the center, between my brother and cousin. We're eating watermelon at my house.
Latest revision as of 19:34, 16 March 2021
Me as a baby
That's me in the center, between my brother and cousin. We're eating watermelon at my grandmother's house.
Jim has completed his PhD in Computer Science from Sorbonne Universities in 2018,
Master of Arts in Mathematics from Mississippi State University, and
Bachelor of Science in Electrical Engineering from Mississippi State University. He has worked at LRDE on the Climb project from 2015 to 2018, and on the Spot project since 2018.
- Functional Languages
- Dynamic Languages
- Rational Languages
- Binary Decision Diagrams
- Type theory
Work in Progress
|newton.22.ifl||Comparing Use-Cases of Tree-Fold vs Fold-Left, How to fold and color a map||Jim Newton||Symposium on Implementation and Application of Functional Languages||31 August 2022|
|newton.21.els||A Portable, Simple, Embeddable Type System||Jim Newton, Adrien Pommellet||Proceedings of the 14th European Lisp Symposium (ELS)||26 April 2021|
|valais.19.els||Implementing Baker's SUBTYPEP decision procedure||Léo Valais, Jim Newton, Didier Verna||12th European Lisp Symposium||1 April 2019|
|newton.19.els||Finite Automata Theory Based Optimization of Conditional Variable Binding||Jim Newton, Didier Verna||European Lisp Symposium||14 January 2019|
|newton.18.meta||Recognizing heterogeneous sequences by rational type expression||Jim Newton, Didier Verna||Proceedings of the Meta'18: Workshop on Meta-Programming Techniques and Reflection||14 September 2018|
|newton.18.els||Approaches in Typecase Optimization||Jim Newton, Didier Verna||European Lisp Symposium||5 April 2018|
|newton.17.els||Programmatic Manipulation of Common Lisp Type Specifiers||Jim Newton, Didier Verna, Maximilien Colange||European Lisp Symposium||6 February 2017|
|newton.16.els||Type-Checking of Heterogeneous Sequences in Common Lisp||Jim Newton, Akim Demaille, Didier Verna||European Lisp Symposium||25 March 2016|
|newton.17.dtd.report||Analysis of Algorithms Calculating the Maximal Disjoint Decomposition of a Set||Jim Newton||2 February 2017|
|newton.16.monad.report||Monads in Common Lisp||Jim Newton||18 November 2016|
|newton.16.dag.report||Finding maximal common joins in a DAG||Jim Newton||17 November 2016|
|newton.16.rte.report||Efficient dynamic type checking of heterogeneous sequences||Jim Newton||22 February 2016|
|newton.18.tocl||A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams||Jim Newton, Didier Verna||ACM Transactions on Computational Logic||28 August 2018|
PHD Theses and Habilitations
|newton.18.phd||Representing and Computing with Types in Dynamically Typed Languages||Jim Newton||1 November 2018|