|
Dana Scott
Dana Stewart Scott (born October 11, 1932) is an American logician who is the emeritus Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University; he is now retired and lives in Berkeley, California. His work on automata theory earned him the Turing Award in 1976, while his collaborative work with Christopher Strachey in the 1970s laid the foundations of modern approaches to the semantics of programming languages. He has also worked on modal logic, topology, and category theory. Early career He received his B.A. in Mathematics from the University of California, Berkeley, in 1954. He wrote his Ph.D. thesis on ''Convergent Sequences of Complete Theories'' under the supervision of Alonzo Church while at Princeton, and defended his thesis in 1958. Solomon Feferman (2005) writes of this period: After completing his Ph.D. studies, he moved to the University of Chicago, working as an instructor there until 1960. In 1959, h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Berkeley, California
Berkeley ( ) is a city on the eastern shore of San Francisco Bay in northern Alameda County, California, United States. It is named after the 18th-century Anglo-Irish bishop and philosopher George Berkeley. It borders the cities of Oakland, California, Oakland and Emeryville, California, Emeryville to the south and the city of Albany, California, Albany and the Unincorporated area, unincorporated community of Kensington, California, Kensington to the north. Its eastern border with Contra Costa County, California, Contra Costa County generally follows the ridge of the Berkeley Hills. The 2020 United States census, 2020 census recorded a population of 124,321. Berkeley is home to the oldest campus in the University of California, the University of California, Berkeley, and the Lawrence Berkeley National Laboratory, which is managed and operated by the university. It also has the Graduate Theological Union, one of the largest religious studies institutions in the world. Berkeley is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Angus Macintyre
Angus John Macintyre FRS, FRSE (born 1941) is a British mathematician and logician who is a leading figure in model theory, logic, and their applications in algebra, algebraic geometry, and number theory. He is Emeritus Professor of Mathematics, at Queen Mary University of London. Education After undergraduate study at the University of Cambridge, he completed his PhD at Stanford University under the supervision of Dana Scott in 1968. Career and research From 1973 to 1985, he was Professor of Mathematics at Yale University. From 1985 to 1999, he was Professor of Mathematical Logic at Merton College at the University of Oxford. In 1999, Macintyre moved to the University of Edinburgh, where he was Professor of Mathematics until 2002, when he moved to Queen Mary College, University of London. Macintyre was the first Scientific Director of the International Centre for Mathematical Sciences (ICMS) in Edinburgh. Macintyre is known for many important results. These include classifi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modal μ-calculus
In theoretical computer science, the modal μ-calculus (Lμ, Lμ, sometimes just μ-calculus, although this can have a more general meaning) is an extension of propositional modal logic (with many modalities) by adding the least fixed point operator μ and the greatest fixed point operator ν, thus a fixed-point logic. The (propositional, modal) μ-calculus originates with Dana Scott and Jaco de Bakker, and was further developed by Dexter Kozen into the version most used nowadays. It is used to describe properties of labelled transition systems and for verifying these properties. Many temporal logics can be encoded in the μ-calculus, including CTL* and its widely used fragments—linear temporal logic and computational tree logic. An algebraic view is to see it as an algebra of monotonic functions over a complete lattice, with operators consisting of functional composition plus the least and greatest fixed point operators; from this viewpoint, the modal μ-calculus is o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semantics Of Programming Languages
In programming language theory, semantics is the rigorous mathematical study of the meaning of programming languages. Semantics assigns computational meaning to valid strings in a programming language syntax. It is closely related to, and often crosses over with, the semantics of mathematical proofs. Semantics describes the processes a computer follows when executing a program in that specific language. This can be done by describing the relationship between the input and output of a program, or giving an explanation of how the program will be executed on a certain platform, thereby creating a model of computation. History In 1967, Robert W. Floyd published the paper ''Assigning meanings to programs''; his chief aim was "a rigorous standard for proofs about computer programs, including proofs of correctness, equivalence, and termination". Floyd further wrote: A semantic definition of a programming language, in our approach, is founded on a syntactic definition. It mus ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logic Of Computable Functions
Logic of Computable Functions (LCF) is a deductive system for computable functions proposed by Dana Scott in 1969 in a memorandum unpublished until 1993. It inspired: * Logic for Computable Functions (LCF), theorem proving logic by Robin Milner. * Programming Computable Functions (PCF), small theoretical programming language by Gordon Plotkin Gordon David Plotkin (born 9 September 1946) is a theoretical computer scientist in the School of Informatics at the University of Edinburgh. Plotkin is probably best known for his introduction of structural operational semantics (SOS) and his ....{{ cite journal , first = Gordon D. , last = Plotkin , authorlink = Gordon Plotkin , title = LCF considered as a programming language , journal = Theoretical Computer Science , year = 1977 , pages = 223–255 , volume = 5 , issue = 3 , doi = 10.1016/0304-3975(77)90044-5 , url = http://homepages.inf.ed.ac.uk/gdp/publications/LCF.pdf , doi-access = free References ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cartesian Monoid
A Cartesian monoid is a monoid, with additional structure of pairing and projection operators. It was first formulated by Dana Scott and Joachim Lambek independently.. Definition A Cartesian monoid is a structure with signature \langle *,e,(-,-),L,R\rangle where * and (-,-) are binary operations, L, R, and e are constants satisfying the following axioms for all x,y,z in its universe The universe is all of space and time and their contents. It comprises all of existence, any fundamental interaction, physical process and physical constant, and therefore all forms of matter and energy, and the structures they form, from s ...: ; Monoid : * is a monoid with identity e ; Left Projection : L * (x,\,y) = x ; Right Projection :R * (x,\,y) = y ; Surjective Pairing : (L*x,\,R*x) = x ; Right Homogeneity : (x*z,\,y*z)=(x,\,y) * z The interpretation is that L and R are left and right projection functions respectively for the pairing function (-,-). References {{reflist Mat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Automata Theory
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science with close connections to cognitive science and mathematical logic. The word ''automata'' comes from the Greek word αὐτόματος, which means "self-acting, self-willed, self-moving". An automaton (automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a finite automaton (FA) or finite-state machine (FSM). The figure on the right illustrates a finite-state machine, which is a well-known type of automaton. This automaton consists of states (represented in the figure by circles) and transitions (represented by arrows). As the automaton sees a symbol of input, it makes a transition (or jump) to another state, according to its transition function, which takes the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Martin Davies (philosopher)
Martin Davies (born 1950) is a British philosopher who is Wilde Professor of Mental Philosophy Emeritus at the University of Oxford and Fellow of Corpus Christi College, Oxford where he taught from 2006 until 2017. He works in philosophy of mind, philosophy of language, epistemology and philosophy of psychology and cognitive science. Education and career Davies was an undergraduate at Monash University and then earned B.Phil. and D.Phil. degrees at Oxford University, working with Gareth Evans, Christopher Peacocke and Dana Scott. He taught at the University of Essex, Birkbeck College, London, and was Wilde Reader in Mental Philosophy at Oxford from 1993 to 2000. He then took up a Professorship at the Australian National University before returning to Oxford in 2006 as the Wilde Professor. He retired from that position in 2017. He is an elected Fellow of both the Australian Academy of the Humanities and the Academy of the Social Sciences in Australia The Academy of th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David Turner (computer Scientist)
David A. Turner (26 January 1946 – 19 October 2023) was a British computer scientist. He is best known for designing and implementing three programming languages, including the first for functional programming based on lazy evaluation, combinator graph reduction, and polymorphic types: SASL (1972), Kent Recursive Calculator (KRC) (1981), and the commercially supported Miranda (1985). Turner's work on Miranda had a strong influence on the later Haskell. Turner first implemented SASL using the abstract SECD machine, but then reimplemented them in 1978 using SKI combinator calculus. This approach was used by Thomas Johnsson and Lennart Augustsson in the design of the g-machine that evolved to become the standard mechanism for lazy evaluation in call-by-need languages. In 1981, Turner received the Doctor of Philosophy (D.Phil.) from the University of Oxford, for his dissertation "Aspects of the Implementation of Programming Languages: The Compilation of an Applicative La ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Krister Segerberg
Krister is a Swedish variant of the Swedish masculine given name Christer and may refer to: *Krister Bringéus (born 1954), Swedish diplomat *Krister Classon (born 1955), Swedish comedian, actor, director and screenwriter *Krister Dreyer (born 1974), Norwegian musician *Krister Hammarbergh (born 1963), Swedish politician of the Moderate Party *Krister Henriksson (born 1946), Swedish actor *Krister Kristensson (1942–2023), Swedish football player *Krister Linder (born 1970), Swedish electronic musician *Krister Nordin (born 1968), Swedish football player *Krister Örnfjäder (born 1952), Swedish social democratic politician *Krister Sørgård (born 1970), Norwegian cross country skier *Krister Stendahl Krister Olofson Stendahl (21 April 1921 – 15 April 2008) was a Swedish theologian, New Testament scholar, and Church of Sweden Bishop of Stockholm. He also served as dean, professor, and professor emeritus at Harvard Divinity School. Life ... (1921–2008), Swedish theologi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fred S
Fred or FRED may refer to: People * Fred (name), including a list of people and characters with the name Mononym * Fred (cartoonist) (1931–2013), pen name of Fred Othon Aristidès, French * Fred (footballer, born 1949) (1949–2022), Frederico Rodrigues de Oliveira, Brazilian * Fred (footballer, born 1979), Helbert Frederico Carreiro da Silva, Brazilian * Fred (footballer, born 1983), Frederico Chaves Guedes, Brazilian * Fred (footballer, born 1986), Frederico Burgel Xavier, Brazilian * Fred (footballer, born 1993), Frederico Rodrigues de Paula Santos, Brazilian * Fred Again (born 1993), British songwriter known as FRED Television and movies * ''Fred'' (2014 film), a 2014 documentary film * Fred Figglehorn, a YouTube character created by Lucas Cruikshank ** ''Fred'' (franchise), a Nickelodeon media franchise ** '' Fred: The Movie'', a 2010 independent comedy film * '' Fred the Caveman'', French Teletoon production from 2002 * Fred Flintstone, of the 1966 TV cartoon ' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Marko Petkovšek
Marko Petkovšek (1955 – 24 March 2023) was a Slovenian mathematician working mainly in symbolic computation. He was a professor of discrete and computational mathematics at the University of Ljubljana. He is best known for Petkovšek's algorithm, and for the book that he coauthored with Herbert Wilf and Doron Zeilberger, '' A = B''. Education and career Petkovšek was born in 1955 in Ljubljana, Slovenia. He attended the University of Ljubljana for his bachelors and masters degrees, which he finished respectively in 1978 and 1986. He completed his PhD at Carnegie Mellon University under the supervision of Dana Scott Dana Stewart Scott (born October 11, 1932) is an American logician who is the emeritus Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University; he is now retired and lives in Berkeley, C ..., with a thesis titled ''Finding Closed-Form Solutions of Difference Equations by Symbolic Methods''. After his PhD ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
