Miller, Dale
Enlarge text Shrink text-
Personality
|
System number
987007460998405171
-
Save successfulThe item can be found in your Personal ZoneשגיאהLog in to your account to save
Information for Authority record
Name (Latin)
Miller, Dale
Other forms of name
Miller, D. (Dale)
Miller, Dale A
Date of birth
1956-12-11
Associate group
INRIA-Saclay
Gender
male
MARC
MARC
Other Identifiers
Sources of Information
- 2nd International Conference on Formal Structures for Computation and Deduction, September 2017:title page (Dale Miller, editor)
- OCLC, 24 June 2010(hdg.: Miller, Dale, 1956-; usage: Dale Miller)
- Logic programming, c1993:t.p. (Dale Miller) p. xiii (Univ. of Penn.)
- OCLC #18293968, 4/17/95(hdg.: Miller, Dale A.; usage Dale A. Miller)
- OCLC #25511436, 4/17/95(hdg.: Miller, Dale A.; usage D. Miller)
- Programming with higher-order logic, 2012:ECIP t.p. (Dale Miller; INRIA Saclay, Ile de France) data view (b. December 11, 1956; currently Director of Research at INRIA-Saclay where he is the Scientific Leader of the Parsifal team; has been a professor at the University of Pennsylvania and at the Ecole Polytechnique (France) and a Department Head at the Pennsylvania State University; has held visiting positions at the universities of Aix-Marseille, Sienna, Genoa, Pisa, and Edinburgh; received his PhD in Mathematics in 1983 from Carnegie Mellon University)
Wikipedia description:
Dale Miller is an American computer scientist and author. He is a Director of Research at Inria Saclay and one of the designers of the λProlog programming language and the Abella interactive theorem prover. Miller is most known for his research on topics in computational logic, including proof theory, automated reasoning, and formalized meta-theory. He has co-authored the book Programming with Higher-order Logic. Miller is a Fellow of the Association for Computing Machinery (ACM), has been a two-term Editor-in-Chief of the ACM Transactions on Computational Logic from 2009 to 2015 and holds an editorial appointment on the Journal of Automated Reasoning.
Read more on Wikipedia >