About: Harry Mairson     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatProgrammingLanguageResearchers, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FHarry_Mairson

Harry George Mairson is a theoretical computer scientist and Professor of Computer Science in the Volen National Center for Complex Systems at Brandeis University in Waltham, Massachusetts. His research is in the fields of logic in computer science, lambda calculus and functional programming, type theory and constructive mathematics, computational complexity theory, and algorithmics.

AttributesValues
rdf:type
rdfs:label
  • Harry Mairson
rdfs:comment
  • Harry George Mairson is a theoretical computer scientist and Professor of Computer Science in the Volen National Center for Complex Systems at Brandeis University in Waltham, Massachusetts. His research is in the fields of logic in computer science, lambda calculus and functional programming, type theory and constructive mathematics, computational complexity theory, and algorithmics.
sameAs
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
foaf:name
  • Harry Mairson
dct:description
  • American computer scientist
foaf:givenName
  • Harry
foaf:gender
  • male
foaf:isPrimaryTopicOf
foaf:surname
  • Mairson
prov:wasDerivedFrom
has abstract
  • Harry George Mairson is a theoretical computer scientist and Professor of Computer Science in the Volen National Center for Complex Systems at Brandeis University in Waltham, Massachusetts. His research is in the fields of logic in computer science, lambda calculus and functional programming, type theory and constructive mathematics, computational complexity theory, and algorithmics. Mairson received a B.A. in Mathematics from Yale University in 1978 and a Ph.D. in Computer Science from Stanford University in 1984 under the supervision of Jeffrey Ullman. His Ph.D. thesis, The Program Complexity of Searching a Table, won the Machtey Award at the 1983 IEEE Symposium on Foundations of Computer Science (FOCS). Mairson was a Postdoctoral researcher at INRIA Rocqencourt from 1984 to 1985, at Stanford University in 1985, and at the University of Oxford in 1986. He held a Visiting Professor position from 1999 to 2001 at Boston University. From 2005 to 2007, Mairson has served as the Chair of the Faculty Senate at Brandeis. He is currently an Associate Editor of the journal Logical Methods in Computer Science and Information and Computation, and sits on the editorial board of Higher-Order and Symbolic Computation. Mairson's contributions to the theory of programming languages include proving that type inference for the ML programming language, so-called Hindley–Milner type inference, is complete for exponential time and that parallel beta reduction is non-elementary.
http://purl.org/voc/vrank#hasRank
http://purl.org/li...ics/gold/hypernym
is Link from a Wikipage to another Wikipage of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git39 as of Aug 09 2019


Alternative Linked Data Documents: PivotViewer | iSPARQL | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3235 as of Jun 25 2020, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (61 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2020 OpenLink Software