Concept

System programming language

A system programming language is a programming language used for system programming; such languages are designed for writing system software, which usually requires different development approaches when compared with application software. Edsger Dijkstra refers to these languages as machine oriented high order languages, or mohol. General-purpose programming languages tend to focus on generic features to allow programs written in the language to use the same code on different platforms. Examples of such languages include ALGOL and Pascal. This generic quality typically comes at the cost of denying direct access to the machine's internal workings, and this often has negative effects on performance. System languages, in contrast, are designed not for compatibility, but for performance and ease of access to the underlying hardware while still providing high-level programming concepts like structured programming. Examples include SPL and ESPOL, both of which are similar to ALGOL in syntax but tuned to their respective platforms. Others are cross-platform but designed to work close to the hardware, like BLISS, JOVIAL and BCPL. Some languages straddle the system and application domains, bridging the gap between these uses. The canonical example is C, which is used widely for both system and application programming. Some modern languages also do this such as Rust and Swift. In contrast with application languages, system programming languages typically offer more-direct access to the physical hardware of the machine: an archetypical system programming language in this sense was BCPL. System programming languages often lack built-in input/output (I/O) facilities because a system-software project usually develops its own I/O mechanisms or builds on basic monitor I/O or screen management facilities. The distinction between languages used for system programming and application programming became blurred over time with the widespread popularity of PL/I, C and Pascal.

Official source

https://en.wikipedia.org/wiki/System_programming_language

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related courses (4)

CS-462: Programming language foundations

This course provides an introduction to the theory of programming languages, with an emphasis on language design and formal semantics.

BIO-373: Genetics and genomics

The theoretical part of this course covers classical genetics and contemporary genomics. Because bioinformatics has become important for genomic research, the course also includes practical applications to genomic analyses using Python, including group pro ...

CS-455: Topics in theoretical computer science

The students gain an in-depth knowledge of several current and emerging areas of theoretical computer science. The course familiarizes them with advanced techniques, and develops an understanding of fundamental questions that underlie some of the key probl ...

Related lectures (32)

Separation is all you need: Foundations for Modular Verification

Explores the foundations of modular verification using Separation Logic for realistic concurrent programs and discusses the challenges of shared mutable state in concurrency.

Solving Tasks with Thymio MOOC: The Thymio robot as a tool for discovering digital science

Focuses on programming with Thymio, solving problem-oriented tasks and assessing the robot's abilities.

Strings in C: Initialization and Memory Management

Covers the representation and management of strings in C, highlighting key differences from other programming languages.

Related units (5)

IRGC - Administration

Very Large Scale Computing Laboratory

Laboratory for Automated Reasoning and Analysis

Related startups (1)

Cyberbotics

Active in robotics, simulation and modeling. Cyberbotics provides Webots, an open-source robot simulator since 1998, offering a comprehensive environment for modeling, programming, and simulating robots in various industries, education, and research.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Official source

https://en.wikipedia.org/wiki/System_programming_language

About this result

Related courses (4)

CS-462: Programming language foundations

This course provides an introduction to the theory of programming languages, with an emphasis on language design and formal semantics.

BIO-373: Genetics and genomics

CS-455: Topics in theoretical computer science

Related lectures (32)

Separation is all you need: Foundations for Modular Verification

Explores the foundations of modular verification using Separation Logic for realistic concurrent programs and discusses the challenges of shared mutable state in concurrency.

Solving Tasks with Thymio MOOC: The Thymio robot as a tool for discovering digital science

Focuses on programming with Thymio, solving problem-oriented tasks and assessing the robot's abilities.

Strings in C: Initialization and Memory Management

Covers the representation and management of strings in C, highlighting key differences from other programming languages.

Related publications (11)

Formally Verified Linear-Time Invertible Lexing

We present ZipLex, a verified framework for invertible linear-time lexical analysis following the longest match (maximal munch) semantics. Unlike past verified lexers that focus only on satisfying the semantics of regular expressions and the longest match property, ZipLex also guarantees that lexing and printing are mutual inverses. Thanks to verified memoization, it also ensures that the lexical analysis of a string is linear in the size of the string. Our design and implementation rely on two sets of idea

Springer Science and Business Media Deutschland GmbH2026

Existentialize Your Generics

The two main approaches to compile generic programs are dynamic dispatch and monomorphization. While the latter is typically preferred in the context of low latency applications, where the overhead of boxing may be prohibitive, it also comes at the cost of important limitations in terms of modularity, expressiveness, and code size. The Swift programming language proposes an interesting third alternative that addresses these shortcomings, supporting dynamic dispatch without requiring boxing by factoring meth

ACM2025

Optimizing regex compilers

Modern regular expressions are powerful string-processing tools, available in most programming languages. However, their power comes at a cost. Most regex engines exhibit worst-case exponential time complexity with respect to the input size, because they rely on a backtracking matching algorithm. This can result in severe performance issues, and can be a vulnerability when the input string or the regex is controlled by the user, leading to so-called Regular Expression Denial of Service (ReDoS) attacks. Fort

École Polytechnique Fédérale de Lausanne2025

Related people (10)

James Richard Larus

Expertise James Larus is a Professor Emeritus and former Dean of the School of Computer and Communication Sciences (IC) at EPFL (école Polytechnique Fédérale de Lausanne). Before joining IC in October 2013, Larus was a researcher, manager, and director in Microsoft Research for over 16 years and an Assistant and Associate Professor in the Computer Sciences Department at the University of Wisconsin, Madison.Larus has been an active contributor to numerous communities. He published over 100 papers (with 14 be

Sandy Ingram

Expertise Programming Languages (C, SQL, Ruby, Rails, Java, Javascript)Recommendation algorithmsSocial media design for collaborative work Sandy's research is mainly focused on the design and development of Personal Learning Environments and contextual recommender systems. Currently working on the Jumpers CTI project.Also involved in the STELLAR Network of Excellence in Technology Enhanced Learning(EU, FP7). Among other things, she chaired the program for JTEL Winter School 2011.Worked on the ROLE Project (

Francesco Mondada

Dr. Mondada received his M.Sc. in micro-engineering in 1991 and his Doctoral degree in 1997 at EPFL. During his thesis he co-founded the company K-Team, being both CEO and president of the company for about 5 years. He is one of the three main developers of the Khepera robot, considered as a standard in bio-inspired robotics and used by more than 1,000 universities and research centers worldwide. Fully back in research in 2000 and after a short period at CALTECH, he participated to the SWARM-BOTS project as the main developer of the s-bot robot platform, which was ranked on position 39 in the list of The 50 Best Robots Ever (fiction or real) by the Wired Journal in 2006. The SWARM-BOTS project was selected as FET-IST success story by the EU commission. He is author of more than 100 papers in the field of bio-inspired robotics and system level robot design. He is co-editor of several international conference proceedings. In November 2005 he received the EPFL Latsis University prize for his contributions to bio-inspired robotics. In 2011 he received the "Crédit Suisse Award for Best Teaching" from EPFL and in 2012 the "polysphère" award from the students as best teacher in the school of engineering. His interests include the development of innovative mechatronic solutions for mobile and modular robots, the creation of know-how for future embedded applications, and making robot platforms more accessible for education, research, and industrial development.

Mikaël Mayer

Martin Odersky

Martin Odersky heads the programming research group at EPFL. His research interests cover fundamental as well as applied aspects of programming languages. They include semantics, type systems, programming language design, and compiler construction. The main focus if his work lies in the integration of object-oriented and functional programming. His research thesis is that the two paradigms are just two sides of the same coin and should be unified as much as possible. To prove this he has experimented a number of language designs, from Pizza to GJ to Functional Nets. He has also influenced the development of Java as a co-designer of Java generics and as the original author of the current javac reference compiler. His current work concentrates on the Scala programming language, which unifies FP and OOP, while staying completely interoperable with Java and .NET. Martin Odersky got his doctorate from ETHZ, in 1989. He held research positions at the IBM T.J. Watson Research Center from 1989 and at Yale University from 1991. He was then a professor at the University of Karlsruhe from 1993 and at the University of South Australia from 1997. He joined EPFL as full professor in 1999. He is associate editor of the Journal of Functional Programming and member of IFIP WG 2.8. He was conference chair for ICFP 2000, and program chair for ECOOP 2004 as well as ETAPS/CC 2007.

Dimitri Racordon

Expertise Programming language design, type systems, memory safety I got my Ph.D. in computer science at the University of Geneva, Switzerland. I worked on model checking and developed efficient data structures to generate and explore large state spaces. SI then studied logics and type systems while trying to find new ways to teach computer science.I have always loved coding, but quickly realized I'm not so good at writing correct programs. So I thought I'd better write clever compilers to do it for me. Eve

Viktor Kuncak

Viktor Kunčak joined EPFL in 2007, after receiving a PhD degree from MIT. Since then has been leading the Laboratory for Automated Reasoning and Analysis and supervised at least 12 completed PhD theses. His works on languages, algorithms and systems for verification and automated reasoning. He served as an initiator and one of the coordinators of a European network (COST action) in the area of automated reasoning, verification, and synthesis. In 2012 he received a 5-year single-investigator European Research Council (ERC) grant of 1.5M EUR. His invited talks include those at Lambda Days, Scala Days, NFM, LOPSTR, SYNT, ICALP, CSL, RV, VMCAI, and SMT. A paper on test generation he co-authored received an ACM SIGSOFT distinguished paper award at ICSE. A PLDI paper he co-authored was published in the Communications of the ACM as a Research Highlight article. His Google Scholar profile reports an over-approximate H-index of 38. He was an associate editor of ACM Transactions on Programming Languages and Systems (TOPLAS) and served as a co-chair of conferences on Computer-Aided Verification (CAV), Formal Methods in Computer Aided Design (FMCAD), Workshop on Synthesis (SYNT), and Verification, Model Checking, and Abstract Interpretation (VMCAI). At EPFL he teaches courses on functional and parallel programming, compilers, and verification. He has co-taught the MOOC "Parallel Programming" that was visited by over 100'000 learners and completed by thousands of students from all over the world.

Sébastien Jean Robert Doeraene

Expertise Language design, compilers, virtual machines.Pedagogy in computer science. Current Work Scala.js, the dialect of Scala for JavaScript and WebAssembly Sébastien Doeraene is a compiler/runtime systems hacker and a Scala enthusiast. Best known as the author of Scala.js, he is now lecturer at EPFL. He holds a PhD from EPFL, having worked under the supervision of Prof. Martin Odersky, and a master's degree in computer science engineering from Université catholique de Louvain in Belgium. When he is not

Marco Mattavelli

Teaching & PhD Past EPFL PhD Students Christophe Clerc, Ruohua Zhou, Beilu Shao, Christophe Lucarz, Richard Thavot, Ab Al Hadi Bin Ab Rahman, Endri Bezati, Simone Casale Brunet, Malgorzata Michalska, Ana Angelica Hernandez Lopez, Aurélien Bloch, Mustafa Besirli, Ünsal Öztürk Past EPFL PhD Students as codirector Sylvain Aguirre Courses Systems and architectures for signal processing EE-555 Study of the essential components and implementation technologies of digital signal processing and commu

Liliane-Joy Yana Dandy

Related units (5)

IRGC - Administration

Very Large Scale Computing Laboratory

Laboratory for Automated Reasoning and Analysis

Related startups (1)

Cyberbotics

Related concepts (10)

Comparison of programming languages

Programming languages are used for controlling the behavior of a machine (often a computer). Like natural languages, programming languages follow rules for syntax and semantics. There are thousands of programming languages and new ones are created every year. Few languages ever become sufficiently popular that they are used by more than a few people, but professional programmers may use dozens of languages in a career. Most programming languages are not standardized by an international (or national) standard, even widely used ones, such as Perl or Standard ML (despite the name).

Swift (programming language)

Swift is a high-level general-purpose, multi-paradigm, compiled programming language developed by Apple Inc. and the open-source community. First released in June 2014, Swift was developed as a replacement for Apple's earlier programming language Objective-C, as Objective-C had been largely unchanged since the early 1980s and lacked modern language features. Swift works with Apple's Cocoa and Cocoa Touch frameworks, and a key aspect of Swift's design was the ability to interoperate with the huge body of existing Objective-C code developed for Apple products over the previous decades.

Nim (programming language)

Nim is a general-purpose, multi-paradigm, statically typed, compiled high-level systems programming language, designed and developed by a team around Andreas Rumpf. Nim is designed to be "efficient, expressive, and elegant", supporting metaprogramming, functional, message passing, procedural, and object-oriented programming styles by providing several features such as compile time code generation, algebraic data types, a foreign function interface (FFI) with C, C++, Objective-C, and JavaScript, and supporting compiling to those same languages as intermediate representations.

Related people (10)

Sébastien Jean Robert Doeraene

Marco Mattavelli

Liliane-Joy Yana Dandy