Where results make sense

About us   |   Why use us?   |   Reviews   |   PR   |   Contact us

Topic: Category:Systems programming languages

    Note: these results are not from the primary (high quality) database.

Lambda the Ultimate theory The aim of these course notes is to show that notions and ideas from Category Theory can be useful tools in Computer Science, by illustrating some recent applications to the study of programming languages based on the principle "notions of computation as monads". This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The semantics of programming languages typically uses category theory to represent the denotations of programs, so that a program and its output have the same value. lambda-the-ultimate.org /classic/theory.html

tcl_unicon.html Both languages discussed below are to be contrasted with Systems Programming Languages, which are languages designed for writing all types of software systems in an imperative style that maps 1:1 onto underlying hardware. John Ousterhout, who is a brilliant marketer and certifiable genius, founded a company to develop Tcl and wrote a paper ignoring the other very high level languages and extolling Scripting Languages as the category to watch, partly as part of his company's marketing campaign. They wanted a higher market share of attention, and especially didn't want to hear that they hadn't invented the language category and in fact had ignored many language features done better in earlier very high level languages, and had repeated mistakes these earlier languages had encountered and had to overcome over a 30 year timespan. www.cs.nmsu.edu /~jeffery/courses/581/tcl_unicon.html

Category:Systems programming languages - Art History Online Reference and Guide This category lists programming languages that provide adequate support for doing systems programming. Category:Systems programming languages - Art History Online Reference and Guide Category:Systems programming languages - Your Art History Reference Guide! www.arthistoryclub.com /art_history/Category:Systems_programming_languages

Programming Language and Compiler Research Groups Haskell language and implementation; state, input/output, and concurrency; semantics based program manipulation; applications of category theory and type theory; parallel functional programming; functional languages for massive parallelism; using functional languages for hardware specification, synthesis and analysis; large applications of functional languages. Programming logics and the Martin-Löf theory of types; functional programming languages, their use and implementation; process calculi such as CCS; developing tools and methodologies for deriving correct as well as efficient programs. Facile is a high-level, higher-order programming language for systems that require a combination of complex data manipulation and concurrent and distributed computing. www.cs.cmu.edu /afs/cs.cmu.edu/user/mleone/web/language/projects.html

The Journal of Functional Programming Finally, under Applications we consider the use of functional languages in solving real-world problems, either in isolation or as a basis for embedded systems, reports of practical experience, programming techniques, and prototyping. Foundations of functional programming includes topics such as formal semantics, abstract interpretation, combinators and lambda calculi, term and graph rewriting, logic, type theory, and category theory. Implementation of functional languages includes compilation strategies for both uniprocessors and parallel processors; design of novel architectures such as dataflow and graph reduction machines; systems issues such as garbage collection and I/O; and environment issues such as debugging, profiling, and configuration management. www.dcs.gla.ac.uk /jfp/default-NEW.html   (1024 words)

Programming Language and Compiler Research Groups Haskell language and implementation; state, input/output, and concurrency; semantics based program manipulation; applications of category theory and type theory; parallel functional programming; functional languages for massive parallelism; using functional languages for hardware specification, synthesis and analysis; large applications of functional languages. Programming logics and the Martin-Löf theory of types; functional programming languages, their use and implementation; process calculi such as CCS; developing tools and methodologies for deriving correct as well as efficient programs. Facile is a high-level, higher-order programming language for systems that require a combination of complex data manipulation and concurrent and distributed computing. www-2.cs.cmu.edu /afs/cs.cmu.edu/user/mleone/web/language/projects.html   (1438 words)

Programming Language and Compiler Research Groups Haskell language and implementation; state, input/output, and concurrency; semantics based program manipulation; applications of category theory and type theory; parallel functional programming; functional languages for massive parallelism; using functional languages for hardware specification, synthesis and analysis; large applications of functional languages. Programming logics and the Martin-Löf theory of types; functional programming languages, their use and implementation; process calculi such as CCS; developing tools and methodologies for deriving correct as well as efficient programs. Facile is a high-level, higher-order programming language for systems that require a combination of complex data manipulation and concurrent and distributed computing. www-2.cs.cmu.edu /afs/cs.cmu.edu/user/mleone/web/language/projects.html   (1438 words)

Open Directory - Computers:Programming:Languages:Smalltalk This category is for software written in Smalltalk (Smalltalk code), or software written to work intimately with Smalltalk systems and/or code, except for compilers and environments, which have their own category. For all programming languages, significantly different versions of the language are considered different implementations. Smalltalk is and was a breakthrough combination programming language and operating system, created between 1972 and 1980 at the legendary Xerox Palo Alto Research Center: PARC. www.gnuhoo.org /Computers/Programming/Languages/Smalltalk/desc.html   (1438 words)

TAC abstracs A new model construction for higher type systems The second order lambda calculus has been introduced by Girard for proof theoretical studies and reinvented by Reynolds as a tool for the investigation of polymorphism in programming languages. On the homotopy structure of strongly homotopy associative differential algebras We present the homotopy structure of Shad, the category of strongly homotopy associative differential algebras (shad-algebras for short), also called A_infinity-algebras, introduced by Stasheff (1963) for the study of the singular complex of a loop-space. In particular, "homotopy variables" for a space X, with respect to the homotopy category HoTop, form a lattice Fib(X) of types of fibrations over X, which can be identified to the lattice of distinguished subobjects of X in Fr(HoTop). www.disi.unige.it /eventsandseminars/tac/abstracts96.html   (1438 words)

Programming Language Naming Patterns Languages may be placed in more than one category of appropriate; we will not suffer the LimitsOfHierarchies here. Claimed to be the world's first systems programming language; partially based on Algol, which in 1958 was called IAL (International Algorithmic Language). Most of you have noticed that programming language names tend to fall in several different themes. c2.com /cgi/wiki?ProgrammingLanguageNamingPatterns   (1192 words)

Omniseek: /Computing /Programming /Languages /Imperative Languages / category: compiled, imperative languages Description: This is the the set of traditional infix languages other than C and Pascal which each Runtime systems, data representation for polymorphic languages (both dynamically and statically typed), garbage collection, and general memory management. All aspects related to the implementation of imperative and functional programming languages. www.omniseek.com /srch/{22456}   (265 words)

Programming Language Naming Patterns Languages may be placed in more than one category of appropriate; we will not suffer the LimitsOfHierarchies here. Claimed to be the world's first systems programming language; partially based on Algol, which in 1958 was called IAL (International Algorithmic Language). Most of you have noticed that programming language names tend to fall in several different themes. c2.com /cgi/wiki?ProgrammingLanguageNamingPatterns   (265 words)

Programming Language Naming Patterns Languages may be placed in more than one category of appropriate; we will not suffer the LimitsOfHierarchies here. Claimed to be the world's first systems programming language; partially based on Algol, which in 1958 was called IAL (International Algorithmic Language). Most of you have noticed that programming language names tend to fall in several different themes. c2.com /cgi/wiki?ProgrammingLanguageNamingPatterns   (265 words)

Programming Language Naming Patterns Languages may be placed in more than one category of appropriate; we will not suffer the LimitsOfHierarchies here. Claimed to be the world's first systems programming language; partially based on Algol, which in 1958 was called IAL (International Algorithmic Language). Most of you have noticed that programming language names tend to fall in several different themes. c2.com /cgi/wiki?ProgrammingLanguageNamingPatterns   (265 words)

Programming Language Naming Patterns Languages may be placed in more than one category of appropriate; we will not suffer the LimitsOfHierarchies here. Claimed to be the world's first systems programming language; partially based on Algol, which in 1958 was called IAL (International Algorithmic Language). Most of you have noticed that programming language names tend to fall in several different themes. c2.com /cgi/wiki?ProgrammingLanguageNamingPatterns   (265 words)

PL/I - Wikipedia, the free encyclopedia It is undoubtedly one of the most feature-rich programming languages that has ever been created and one of the very first in the highly-feature-rich category. Another variant of PL/I was PL/S, the IBM systems programming language. The language was originally to be called NPL, for "New Programming Language"; but that abbreviation could not be used because it was the name of the National Physical Laboratory in the UK. en.wikipedia.org /wiki/PL/I_programming_language   (265 words)

Programming Language Naming Patterns Languages may be placed in more than one category of appropriate; we will not suffer the LimitsOfHierarchies here. Claimed to be the world's first systems programming language; partially based on Algol, which in 1958 was called IAL (International Algorithmic Language). Most of you have noticed that programming language names tend to fall in several different themes. c2.com /cgi/wiki?ProgrammingLanguageNamingPatterns   (265 words)

Object-Oriented : Computers : Programming : Languages : Object-Oriented This category is on programming languages and documents that fully or partially support the basic principles of object-oriented programming: extensive modularity usually embodied in objects, classes, encapsulation, data hiding, inheritance, polymorphism, message passing, etc. On this page, languages are arranged in three groups and levels: 1) Top group: issues spanning multiple unrelated languages. O'small : Concise, simple OO language for teaching; and study of semantics of inheritance, and OO languages in denotational style, later became subject of research on type inference systems and abstract machines. Heron-Centric: Ruminations of a Language Designer : A blog which covers language design issues and software development techniques regarding the Heron programming language as well as similar languages like Java and C++. webinfosearch.com /Top/Computers/Programming/Languages/Object-Oriented   (265 words)

The category of constraint systems is Cartesian-closed This makes it possible to use this category to define the semantics of higher-order, concurrent constraint programming languages. Furthermore, the structure of Scott information systems lifts smoothly to the first-order setting--- we show that the category is Cartesian-closed, and other usual functors over Scott information systems (lifting, sums, Smyth power-domain) are also definable and recursive domain equations involving these functors can be solved. Reflecting the computational reality that an agent ``has access'' to only finitely many free variables, we take as morphisms approximable maps that are generic in all but finitely many variables. www2.parc.com /spl/projects/mbc/publications/mbc-cccc-lics92-abstract.html   (229 words)

Programming Language Naming Patterns Languages may be placed in more than one category of appropriate; we will not suffer the LimitsOfHierarchies here. Claimed to be the world's first systems programming language; partially based on Algol, which in 1958 was called IAL (International Algorithmic Language). A semi-serious consideration of what type of programming language the Klingon culture would create. c2.com /cgi/wiki?ProgrammingLanguageNamingPatterns   (229 words)

About the Art of Programming Art After ten years of experiences at the Academy of Media Art, Cologne we learned that there is no chance for artists than to be trained in programming and to be able of questioning the fundamental concepts of programming (languages, models of computation, logics) and the constructions of interfaces. Not only new ways of teaching computer science and programming have to be developed but also new types of systems, which are open-ended and semantically emergent have to be considered. Computers are tools, and should be treated as such; they are neither monsters nor savants, simply tools, in the same category as the printing press, the automobile, and the telephone. www.thinkartlab.com /pkl/media/about.html   (2365 words)

freshmeat.net: Articles: Category reviews This article is aimed at Unix developers who already have some experience with programming languages and want to start developing GUI applications (mainly for The X Window System, though portability is discussed). by Christopher Browne, in Category Reviews - Sat, Oct 6th 2001 00:00 PDT This review discusses lighterweight alternatives, including xBase, DBM, and ISAM systems. osx.freshmeat.net /articles/section/category%20reviews   (2365 words)

Intrafoundation Software - Operating Systems Nov 2002 SAL- Programming - Languages & Compilers Dec 2002 Alsani`s Descent & Category Theory WebPage! Sep 1999 Technifab Products Inc, manufacture cryogenic equipment, vacuum insulated pipe,dewar, asme, nitrogen, helium, transfer hose, LN2 www.intrafoundation.com /operating_systems.html   (2365 words)

Categorical Logic in Computer Science II The new formalisms and logic systems which result from the project should contribute to future developments in high-level programming language design and in mechanised checking or derivation of proofs of correctness of computer systems. The cooperation between partners will be organised around a number of specialised workshops focusing on specific themes: sequentiality and stability, duality in domain theory, logic of inductive and recursive datatypes, subtypes and polymorphism in higher-order languages, higher order modal program logics, monadic programming language semantics, applied linear logic, computational content of classical logic, symbolic computation. These include: the study of type structures for programming languages; the development of structuring principles and axiomatic frameworks for semantics, as a basis for computational logics; and unified treatments of logics and models for parallel computation, and of specification formalisms. www.sts.tu-harburg.de /projects/Esprit-BR/Synopses/Projects/6811.html   (427 words)

node5.html His work in programming languages focuses primarily on the role of type structure in language design, and on the use of operational semantics as the basis for the definition and implementation of programming languages. Professor Reynolds is interested in the design of programming languages and languages for program specification, mathematical tools for defining the semantics of such languages, and methods for proving that programs satisfy their specifications. Prerequisites: 80-210 or 80-211 and a programming course www.cs.cmu.edu /afs/cs/project/pal/www/brochure/node5.html   (9950 words)

node3.html Current research interests of the Program's faculty include: Automated Theorem Proving, Category Theory, Constructive and Feasible Mathematics, Decision Theory, Foundations of Programming Languages, Game Theory, Logics of Programs, Lambda Calculus, Learning Theory, Model Theory, Proof Theory, Set Theory, Set-theoretic Algebra, Temporal and Modal Logics, Theory of Computing, and Type Theory. His current goals are (1) to understand and unify the rich variety of type systems, including polymorphic types, intersection types, and the types of linear logic, that have proliferated in recent years and (2) to extend strong typing and proof systems to low-level languages that give the user control over data representation and storage allocation. Like such fields as elementary logic and set theory, category theory provides a basic conceptual apparatus and a collection of formal methods useful for addressing certain kinds of commonly occurring formal and informal problems, particularly those involving structural and functional considerations. www.cs.cmu.edu /afs/cs/project/pal/www/brochure/node3.html   (9950 words)

Syntactical Gothicisms of the Mind 5) Machine languages: languages to communicate with machines, for now this category consists solely of programming languages though this does not need to be so in the future. Classifier systems solve a problem inventors of languages out-of-thin-air run into: it provides a framework that enables systemised forward-compatible naming of objects yet to be named. Maybe priding yourself on speaking fluent Klingon will stigmatise you as a nerd, but natural languages are not value free either: speech tainted by accent or dialect can be a definite disadvantage in life, while oppressive imperialist regimes do not hesitate to make minority languages illegal. socialfiction.org /onlyone/lanlan.html   (1687 words)

Homepage of Dana G. Harrington Uniqueness type systems for programming languages have distinct `unique' types for values which are used at most once under program evaluation. Calgary Peripatetic Research Group on Logic and Category Theory, and a member of the Programming Languages lab. Uniqueness types are distinguished from other `linear' type systems is the subtype relationship between unique and non-unique types. pages.cpsc.ucalgary.ca /~danaha   (103 words)

COMPUTER AND INFORMATION SCIENCE - CIS   Indeed, logic is useful in areas of computer science as disparate as architecture (logic gates), software engineerng (specification and verification), programming languages (semantics, logic programming), databases (relational algebra and SQL), artificial intelligence (automatic theorem proving), algorithms (complexity and expressiveness), and theory of computation (general notions of computability).   Some central topics include: denotational vs operational semantics, domain theory and category theory, the lamda calculus, type theory (including recursive types, generics, type inference and modules), logics of programs and associated completeness and decidability problems, specification languages, and models of concurrency. Strong generative capacity of grammars, Grammers as deductive systems, parsing as deduction. www.upenn.edu /registrar/register/cis.html   (6854 words)

School announcement The School will offer 5 series of (approx.8-10) introductory and advanced lectures on the connections between Typed Lambda Calculus and Category Theory, Proof Theory, and Type Theory, and on the, more recent, applications of Typed Lambda Calculus, such as the design of Typed Functional Languages, General Proof Assistants, and Program Logics. In recent years, Typed Lambda Calculus has been impressively used also as a {\em metalanguage} for defining formal systems for {\em reasoning} about programs and as a {\em logical framework} for designing {\em interactive proof assistants} for computer aided formal reasoning. In recent years, Typed Lambda Calculus has been impressively used also as a metalanguage for defining formal systems for reasoning about Programs and as a logical framework for designing interactive proof assistants} for computer aided formal reasoning. www.seas.upenn.edu /~sweirich/types/archive/1994/msg00044.html   (801 words)

Try your search on: Qwika (all wikis)

About us   |   Why use us?   |   Reviews   |   Press   |   Contact us   Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.