DOCSLIB.ORG

Introduction to Computer Science Lecture 6: Programming Languages

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Introduction to Computer Science Lecture 6: Programming Languages Introduction to Computer Science Lecture 6: Programming Languages Tian-Li Yu Taiwan Evolutionary Intelligence Laboratory (TEIL) Department of Electrical Engineering National Taiwan University [email protected] Slides made by Tian-Li Yu, Jie-Wei Wu, and Chu-Yu Hsu Tian-Li Yu Programming Languages 1 / 45 Programming Languages and Paradigms PL Generations 1st 2nd 3rd 4th −−−−−−−−−−−−−−−! Machine Assembly Fortran SQL Instructions (Mnemonic Cobol SAS system of MIs) Basic C/C++ Java Tian-Li Yu Programming Languages 2 / 45 Programming Languages and Paradigms Assembler: Translating MIs to Assembly 1st 2nd Machine Assembly instructions 156C LD R5, Price −−−−−−−−−−−−−−−−! 166D LD R6, ShippingCharge −−−−−−−−−−−−−−−−! 5056 ADDI R0, R5, R6 −−−−−−−−−−−−−−−−! 306E ST R0, TotalCost −−−−−−−−−−−−−−−−! C000 HTL −−−−−−−−−−−−−−−−! Mnemonic names for op-codes Identifiers: Descriptive names for memory locations, chosen by the programmer Tian-Li Yu Programming Languages 3 / 45 Programming Languages and Paradigms 3rd Generation Languages (3GL) Characteristics of assembly - Machine dependent - One-to-one mapping - Assembler High-level primitives Machines independent (virtually) One primitive to many MI mapping Compiler & interpreter Tian-Li Yu Programming Languages 4 / 45 Programming Languages and Paradigms Languages and Issues Natural vs. formal languages - Formal language formal grammar ! Portability - Theoretically: different compilers - Reality: Minor modifications Tian-Li Yu Programming Languages 5 / 45 Programming Languages and Paradigms Programming Paradigms LISP ML Schema Functional C++ C# Object-oriented Smalltalk Visual Basic Java Machine FORTRAN BASIC C Ada Imperative Languages COBOL ALGOL APL Pascal GPSS Prolog Declarative 1950 1960 1970 1980 1990 2000 Tian-Li Yu Programming Languages 6 / 45 Programming Languages and Paradigms Imperative vs. Declarative Imperative paradigm - Procedural - Approaching a problem by finding an algorithm to solve the problem. Declarative paradigm - Implemented a general problem solver - Approaching a problem by finding a formal description of the problem. - Will talk more about this later. Tian-Li Yu Programming Languages 7 / 45 Programming Languages and Paradigms Functional Paradigm Inputs: Old_balance Credits Debits Find_sum Find_sum Find_diff Output: New_balance Tian-Li Yu Programming Languages 8 / 45 Programming Languages and Paradigms Functional vs. Imperative (Find diff (Find sum Old balance Credits) (Find sum Debits)) Temp balance Old balance + Credit Total debits sum of all Debits Balance Temp balance Total debits − (Find Quotiant (Find sum Numbers) (Find count Numbers)) Sum sum of all Numbers Count # of Numbers Quotiant Sum = Count Tian-Li Yu Programming Languages 9 / 45 Programming Languages and Paradigms Object-Oriented Paradigm OOP (object-oriented programming) Abstraction Information hiding - Encapsulation - Polymorphism Inheritance References: - http://www.codeproject.com/KB/architecture/OOP_Concepts_and_manymore.aspx - http://en.wikipedia.org/wiki/Object-oriented_programming Tian-Li Yu Programming Languages 10 / 45 Imperative Paradigm More about Imperative Paradigm Variables and data types Data structure Constants and literals Assignment and operators Control Comments Tian-Li Yu Programming Languages 11 / 45 Imperative Paradigm Variables and Data Types Integer Real (floating-point) Character Boolean FORTRAN Pascal C/C++ (Java) INTEGER a; b a; b: integer; int a; b; REAL c; d c; d: real; float c; d; BYTE e; f e; f: char; char e; f; LOGICAL g; h g; h: boolean; bool g; h; Tian-Li Yu Programming Languages 12 / 45 Imperative Paradigm Data Structure Homogeneous array Heterogeneous array FORTRAN INTEGER a(6,3) Pascal a: array[0..5,0..2] of integer; C/C++ int a[5][2]; C/C++ structf char Name[25]; int Age; float SkillRating; g Employee; Tian-Li Yu Programming Languages 13 / 45 Imperative Paradigm Constant and Literals a b + 645; - 645 is a literal const int a=645; final int a=645; A constant cannot be a l-value. - a=b+c; Tian-Li Yu Programming Languages 14 / 45 Imperative Paradigm Assignment and Operators APL Ada, Pascal C/C++ (Java) a <- b + c; a := b + c; a = b + c; Operator precedence Operator overloading Tian-Li Yu Programming Languages 15 / 45 Imperative Paradigm Control Old-fashion: goto goto 40 20 print "passed." goto 70 40 if (grade < 60) goto 60 goto 20 60 print "failed." 70 stop Not recommended in modern programming Modern programming if (grade < 60) then print "failed." else print "passed." Tian-Li Yu Programming Languages 16 / 45 Imperative Paradigm Control Structures Condition Condition true false B? S1 S2 if (B) S1 else S2; Condition false B? Condition while (B) true S1; S1 What switch (N) is the value of N? f case C1: S1;break; N = C1 N = C2 N = C3 case C2: S2;break; S1 S2 S3 case C3: S3;break; g; Tian-Li Yu Programming Languages 17 / 45 Imperative Paradigm Control Structures (contd.) Assign Count the value 1 False Count < 4 ? True Assign Count the Body value Count + 1 for (int Count = 1; Count < 4; Count++) body; Tian-Li Yu Programming Languages 18 / 45 Imperative Paradigm Comments C/C++, Java a = b + c; // This is an end-of-line comment / / ** * This is a This is a documentation block comment comment / * / a=b+c; * a=b+c; Tian-Li Yu Programming Languages 19 / 45 Imperative Paradigm Calling Procedures Calling program unit Control is transferred Procedure to procedure Calling program Procedure is unit requests excuted. procedure. Calling program unit continues Control is returned to calling enviroment when procedure is completed. Tian-Li Yu Programming Languages 20 / 45 Imperative Paradigm Terminology Starting the head with the term “void” is The former parameter list. Note the way that a C programmer specifies that that C, as with many programming the program unit is a procedure rather languages, requires that the data than a function. We will learn about functions type of each parameter be specified. shortly. void ProjectPopulation (float GrowthRate){ int Year; Population[0] = 100.0; for (Year = 0; Year =< 10; Year++) Population[Year+1] = Population[Year] + (Population[Year]*GrowthRate); } This declares a local variable These statements describe how the named Year. populations are to be computed and stored in the global array named Population. Tian-Li Yu Programming Languages 21 / 45 Imperative Paradigm Terminology (contd.) Procedure’s header Local vs. global variables Formal vs. actual parameters Passing parameters - Call by value (passed by value) - Call by reference (passed by reference) - Call by address: variant of call-by-reference. Tian-Li Yu Programming Languages 22 / 45 Imperative Paradigm Call by Value a. When the procedure is called, a copy of data is given to the procedure Calling environment Procedure’s environment 5 5 procedure Demo(Formal ) b. and the procedure manipulates its copy. Formal Formal + 1; Calling environment Procedure’s environment 5 6 Demo(Actual); c. Thus; when the procedure has terminated, the calling environment has not changed. Calling environment 5 Tian-Li Yu Programming Languages 23 / 45 Imperative Paradigm Call by Reference a. When the procedure is called, the formal parameter becomes a reference to the actual parameter. Calling environment Procedure’s environment Actual Formal 5 procedure Demo(Formal ) Formal Formal + 1; b. Thus; changes directed by the procedure are made Demo(Actual); to the actual parameter Calling environment Procedure’s environment Actual Formal 6 C/C++ void Demo(int& Formal) f Formal = Formal + 1; c. and are; therefore; preserved after the procedure has terminated. g Calling environment Actual 6 Tian-Li Yu Programming Languages 24 / 45 Imperative Paradigm Functions vs. Procedures A program unit similar to a procedure unit except that a value is transferred back to the calling program unit as “the value of the function.” The function header begins with the type of the data that will be returned. float CylinderVolumn (float Radius, float Height){ float Volume; Volume = 3.14 * Radius * Radius * Height; return Volume; } Terminate the function and return the Compute the volume of the cylinder value of the variable Volume This declares a local variable named Volume. Tian-Li Yu Programming Languages 25 / 45 Imperative Paradigm The Translation Process Lexical analyzer: identifying tokens. Parser: identifying syntax & semantics. Source Lexical Code Object Parser program analyzer generator program Tian-Li Yu Programming Languages 26 / 45 Imperative Paradigm Syntax Diagrams for Algebra Expression + Expression Term - Term + Term Factor x Factor x y z Tian-Li Yu Programming Languages 27 / 45 Imperative Paradigm Grammar for Algebra Expression Term Term + Expression ! j Term - Expression j Term Factor Factor * Term Factor = Term Factor! x y jz j ! j j Starting: Expression Nonterminals: Expression, Term, Factor Terminals: x, y, z Tian-Li Yu Programming Languages 28 / 45 Imperative Paradigm Parse Tree x + y z × Expression + Term Expression Factor Term x x Factor Term y Factor z Tian-Li Yu Programming Languages 29 / 45 Imperative Paradigm Ambiguity if B1 then if B2 then S1 else S2 Statement Statement if Boolean then else Statement Statement if Boolean then expression Statement expression B1 B1 ifBoolean then ifBoolean then else expression Statement expression Statement Statement B2 S1 B2 S1 S2 Tian-Li Yu Programming Languages 30 / 45 Imperative Paradigm Code Generation Coercion: implicit conversion between data types Strongly typed: no coercion, data types have to agree with each other. Code optimization - x = y + z; - w = x + z; - w = y
Load more

Recommended publications
  • Programming Paradigms & Object-Oriented
    4.3 (Programming Paradigms & Object-Oriented- Computer Science 9608 Programming) with Majid Tahir Syllabus Content: 4.3.1 Programming paradigms Show understanding of what is meant by a programming paradigm Show understanding of the characteristics of a number of programming paradigms (low- level, imperative (procedural), object-oriented, declarative) – low-level programming Demonstrate an ability to write low-level code that uses various address modes: o immediate, direct, indirect, indexed and relative (see Section 1.4.3 and Section 3.6.2) o imperative programming- see details in Section 2.3 (procedural programming) Object-oriented programming (OOP) o demonstrate an ability to solve a problem by designing appropriate classes o demonstrate an ability to write code that demonstrates the use of classes, inheritance, polymorphism and containment (aggregation) declarative programming o demonstrate an ability to solve a problem by writing appropriate facts and rules based on supplied information o demonstrate an ability to write code that can satisfy a goal using facts and rules Programming paradigms 1 4.3 (Programming Paradigms & Object-Oriented- Computer Science 9608 Programming) with Majid Tahir Programming paradigm: A programming paradigm is a set of programming concepts and is a fundamental style of programming. Each paradigm will support a different way of thinking and problem solving. Paradigms are supported by programming language features. Some programming languages support more than one paradigm. There are many different paradigms, not all mutually exclusive. Here are just a few different paradigms. Low-level programming paradigm The features of Low-level programming languages give us the ability to manipulate the contents of memory addresses and registers directly and exploit the architecture of a given processor.
    [Show full text]
  • Functional and Imperative Object-Oriented Programming in Theory and Practice
    Uppsala universitet Inst. för informatik och media Functional and Imperative Object-Oriented Programming in Theory and Practice A Study of Online Discussions in the Programming Community Per Jernlund & Martin Stenberg Kurs: Examensarbete Nivå: C Termin: VT-19 Datum: 14-06-2019 Abstract Functional programming (FP) has progressively become more prevalent and techniques from the FP paradigm has been implemented in many different Imperative object-oriented programming (OOP) languages. However, there is no indication that OOP is going out of style. Nevertheless the increased popularity in FP has sparked new discussions across the Internet between the FP and OOP communities regarding a multitude of related aspects. These discussions could provide insights into the questions and challenges faced by programmers today. This thesis investigates these online discussions in a small and contemporary scale in order to identify the most discussed aspect of FP and OOP. Once identified the statements and claims made by various discussion participants were selected and compared to literature relating to the aspects and the theory behind the paradigms in order to determine whether there was any discrepancies between practitioners and theory. It was done in order to investigate whether the practitioners had different ideas in the form of best practices that could influence theories. The most discussed aspect within FP and OOP was immutability and state relating primarily to the aspects of concurrency and performance. ​ ​ ​ ​ ​ ​ This thesis presents a selection of representative quotes that illustrate the different points of view held by groups in the community and then addresses those claims by investigating what is said in literature.
    [Show full text]
  • Functional and Logic Programming - Wolfgang Schreiner
    COMPUTER SCIENCE AND ENGINEERING - Functional and Logic Programming - Wolfgang Schreiner FUNCTIONAL AND LOGIC PROGRAMMING Wolfgang Schreiner Research Institute for Symbolic Computation (RISC-Linz), Johannes Kepler University, A-4040 Linz, Austria, [email protected]. Keywords: declarative programming, mathematical functions, Haskell, ML, referential transparency, term reduction, strict evaluation, lazy evaluation, higher-order functions, program skeletons, program transformation, reasoning, polymorphism, functors, generic programming, parallel execution, logic formulas, Horn clauses, automated theorem proving, Prolog, SLD-resolution, unification, AND/OR tree, constraint solving, constraint logic programming, functional logic programming, natural language processing, databases, expert systems, computer algebra. Contents 1. Introduction 2. Functional Programming 2.1 Mathematical Foundations 2.2 Programming Model 2.3 Evaluation Strategies 2.4 Higher Order Functions 2.5 Parallel Execution 2.6 Type Systems 2.7 Implementation Issues 3. Logic Programming 3.1 Logical Foundations 3.2. Programming Model 3.3 Inference Strategy 3.4 Extra-Logical Features 3.5 Parallel Execution 4. Refinement and Convergence 4.1 Constraint Logic Programming 4.2 Functional Logic Programming 5. Impacts on Computer Science Glossary BibliographyUNESCO – EOLSS Summary SAMPLE CHAPTERS Most programming languages are models of the underlying machine, which has the advantage of a rather direct translation of a program statement to a sequence of machine instructions. Some languages, however, are based on models that are derived from mathematical theories, which has the advantages of a more concise description of a program and of a more natural form of reasoning and transformation. In functional languages, this basis is the concept of a mathematical function which maps a given argument values to some result value.
    [Show full text]
  • Programming Language
    Programming language A programming language is a formal language, which comprises a set of instructions that produce various kinds of output. Programming languages are used in computer programming to implement algorithms. Most programming languages consist of instructions for computers. There are programmable machines that use a set of specific instructions, rather than general programming languages. Early ones preceded the invention of the digital computer, the first probably being the automatic flute player described in the 9th century by the brothers Musa in Baghdad, during the Islamic Golden Age.[1] Since the early 1800s, programs have been used to direct the behavior of machines such as Jacquard looms, music boxes and player pianos.[2] The programs for these The source code for a simple computer program written in theC machines (such as a player piano's scrolls) did not programming language. When compiled and run, it will give the output "Hello, world!". produce different behavior in response to different inputs or conditions. Thousands of different programming languages have been created, and more are being created every year. Many programming languages are written in an imperative form (i.e., as a sequence of operations to perform) while other languages use the declarative form (i.e. the desired result is specified, not how to achieve it). The description of a programming language is usually split into the two components ofsyntax (form) and semantics (meaning). Some languages are defined by a specification document (for example, theC programming language is specified by an ISO Standard) while other languages (such as Perl) have a dominant implementation that is treated as a reference.
    [Show full text]
  • Logic Programming Logic Department of Informatics Informatics of Department Based on INF 3110 – 2016 2
    Logic Programming INF 3110 3110 INF Volker Stolz – 2016 [email protected] Department of Informatics – University of Oslo Based on slides by G. Schneider, A. Torjusen and Martin Giese, UiO. 1 Outline ◆ A bit of history ◆ Brief overview of the logical paradigm 3110 INF – ◆ Facts, rules, queries and unification 2016 ◆ Lists in Prolog ◆ Different views of a Prolog program 2 History of Logic Programming ◆ Origin in automated theorem proving ◆ Based on the syntax of first-order logic ◆ 1930s: “Computation as deduction” paradigm – K. Gödel 3110 INF & J. Herbrand – ◆ 1965: “A Machine-Oriented Logic Based on the Resolution 2016 Principle” – Robinson: Resolution, unification and a unification algorithm. • Possible to prove theorems of first-order logic ◆ Early seventies: Logic programs with a restricted form of resolution introduced by R. Kowalski • The proof process results in a satisfying substitution. • Certain logical formulas can be interpreted as programs 3 History of Logic Programming (cont.) ◆ Programming languages for natural language processing - A. Colmerauer & colleagues ◆ 1971–1973: Prolog - Kowalski and Colmerauer teams 3110 INF working together ◆ First implementation in Algol-W – Philippe Roussel – 2016 ◆ 1983: WAM, Warren Abstract Machine ◆ Influences of the paradigm: • Deductive databases (70’s) • Japanese Fifth Generation Project (1982-1991) • Constraint Logic Programming • Parts of Semantic Web reasoning • Inductive Logic Programming (machine learning) 4 Paradigms: Overview ◆ Procedural/imperative Programming • A program execution is regarded as a sequence of operations manipulating a set of registers (programmable calculator) 3110 INF ◆ Functional Programming • A program is regarded as a mathematical function – 2016 ◆ Object-Oriented Programming • A program execution is regarded as a physical model simulating a real or imaginary part of the world ◆ Constraint-Oriented/Declarative (Logic) Programming • A program is regarded as a set of equations ◆ Aspect-Oriented, Intensional, ..
    [Show full text]
  • Multi-Paradigm Declarative Languages*
    c Springer-Verlag In Proc. of the International Conference on Logic Programming, ICLP 2007. Springer LNCS 4670, pp. 45-75, 2007 Multi-paradigm Declarative Languages⋆ Michael Hanus Institut f¨ur Informatik, CAU Kiel, D-24098 Kiel, Germany. [email protected] Abstract. Declarative programming languages advocate a program- ming style expressing the properties of problems and their solutions rather than how to compute individual solutions. Depending on the un- derlying formalism to express such properties, one can distinguish differ- ent classes of declarative languages, like functional, logic, or constraint programming languages. This paper surveys approaches to combine these different classes into a single programming language. 1 Introduction Compared to traditional imperative languages, declarative programming lan- guages provide a higher and more abstract level of programming that leads to reliable and maintainable programs. This is mainly due to the fact that, in con- trast to imperative programming, one does not describe how to obtain a solution to a problem by performing a sequence of steps but what are the properties of the problem and the expected solutions. In order to define a concrete declarative language, one has to fix a base formalism that has a clear mathematical founda- tion as well as a reasonable execution model (since we consider a programming language rather than a specification language). Depending on such formalisms, the following important classes of declarative languages can be distinguished: – Functional languages: They are based on the lambda calculus and term rewriting. Programs consist of functions defined by equations that are used from left to right to evaluate expressions.
    [Show full text]
  • Best Declarative Programming Languages
    Best Declarative Programming Languages mercurializeEx-directory Abdelfiercely cleeked or superhumanizes. or surmount some Afghani hexapod Shurlocke internationally, theorizes circumspectly however Sheraton or curve Sheffie verydepressingly home. when Otis is chainless. Unfortified Odie glistens turgidly, he pinnacling his dinoflagellate We needed to declarative programming, features of study of programming languages best declarative level. Procedural knowledge includes knowledge of basic procedures and skills and their automation. Get the highlights in your inbox every week. Currently pursuing MS Data Science. And this an divorce and lets the reader know something and achieve. Conclusion This post its not shut to weigh the two types of above query languages against this other; it is loathe to steady the basic pros and cons to scrutiny before deciding which language to relate for rest project. You describe large data: properties and relationships. Excel users and still think of an original or Google spreadsheet when your talk about tabular data. Fetch the bucket, employers are under for programmers who can revolve on multiple paradigms to solve problems. One felt the main advantages of declarative programming is that maintenance can be performed without interrupting application development. Follows imperative approach problems. To then that mountain are increasingly adding properties defined in different more abstract and declarative manner. Please enter their star rating. The any is denotational semantics, they care simply define different ways to eating the problem. Imperative programming with procedure calls. Staying organized is imperative. Functional programming is a declarative paradigm based on a composition of pure functions. Markup Language and Natural Language are not Programming Languages. Between declarative and procedural knowledge of procedural and functional programming languages permit side effects, open outer door.
    [Show full text]
  • Comparative Studies of 10 Programming Languages Within 10 Diverse Criteria
    Department of Computer Science and Software Engineering Comparative Studies of 10 Programming Languages within 10 Diverse Criteria Jiang Li Sleiman Rabah Concordia University Concordia University Montreal, Quebec, Concordia Montreal, Quebec, Concordia [email protected] [email protected] Mingzhi Liu Yuanwei Lai Concordia University Concordia University Montreal, Quebec, Concordia Montreal, Quebec, Concordia [email protected] [email protected] COMP 6411 - A Comparative studies of programming languages 1/139 Sleiman Rabah, Jiang Li, Mingzhi Liu, Yuanwei Lai This page was intentionally left blank COMP 6411 - A Comparative studies of programming languages 2/139 Sleiman Rabah, Jiang Li, Mingzhi Liu, Yuanwei Lai Abstract There are many programming languages in the world today.Each language has their advantage and disavantage. In this paper, we will discuss ten programming languages: C++, C#, Java, Groovy, JavaScript, PHP, Schalar, Scheme, Haskell and AspectJ. We summarize and compare these ten languages on ten different criterion. For example, Default more secure programming practices, Web applications development, OO-based abstraction and etc. At the end, we will give our conclusion that which languages are suitable and which are not for using in some cases. We will also provide evidence and our analysis on why some language are better than other or have advantages over the other on some criterion. 1 Introduction Since there are hundreds of programming languages existing nowadays, it is impossible and inefficient
    [Show full text]
  • Using Declarative Programming in an Introductory Computer Science Course for High School Students
    Proceedings of the Sixth Symposium on Educational Advances in Artificial Intelligence (EAAI-16) Using Declarative Programming in an Introductory Computer Science Course for High School Students Maritza Reyes,1 Cynthia Perez,2 Rocky Upchurch,3 Timothy Yuen,4 and Yuanlin Zhang5 1Department of Psychology, University of Texas at Austin, USA 2Department of Psychology, Texas Tech University, USA 3New Deal High School, Lubbock, Texas, USA 4Department of Interdisciplinary Learning and Teaching, University of Texas at San Antonio, USA 5Department of Computer Science, Texas Tech University, USA 1maritza [email protected], [email protected], [email protected], [email protected], [email protected] Abstract proach (Gelfond and Kahl 2014). The course described in this paper was offered during the summer of 2015. The course Though not often taught at the K-12 level, declarative pro- gramming is a viable paradigm for teaching computer science met Monday through Friday from 1:00pm to 1:50pm, and due to its importance in artificial intelligence and in helping was taught in a computer lab. student explore and understand problem spaces. This paper This course was offered as part of the TexPREP program discusses the authors’ design and implementation of a declar- hosted at Texas Tech University. TexPREP is a math, science, ative programming course for high school students during a and engineering summer enrichment program for 6th - 12th 4-week summer session. graders. Each summer, students take courses in math, science, and engineering typically taught by local K-12 teachers and Background and Rationale university students, and occasionally by university faculty. Computer science education researchers have long debated Students taking this course were in their fourth year of the imperative versus object-oriented approaches to teaching in- TexPREP program, and had taken two CS courses (CS2 and troductory computer science courses, but the conversation CS3) prior to CS4.
    [Show full text]
  • Comparative Studies of 10 Programming Languages Within 10 Diverse Criteria Revision 1.0
    Comparative Studies of 10 Programming Languages within 10 Diverse Criteria Revision 1.0 Rana Naim∗ Mohammad Fahim Nizam† Concordia University Montreal, Concordia University Montreal, Quebec, Canada Quebec, Canada [email protected] [email protected] Sheetal Hanamasagar‡ Jalal Noureddine§ Concordia University Montreal, Concordia University Montreal, Quebec, Canada Quebec, Canada [email protected] [email protected] Marinela Miladinova¶ Concordia University Montreal, Quebec, Canada [email protected] Abstract This is a survey on the programming languages: C++, JavaScript, AspectJ, C#, Haskell, Java, PHP, Scala, Scheme, and BPEL. Our survey work involves a comparative study of these ten programming languages with respect to the following criteria: secure programming practices, web application development, web service composition, OOP-based abstractions, reflection, aspect orientation, functional programming, declarative programming, batch scripting, and UI prototyping. We study these languages in the context of the above mentioned criteria and the level of support they provide for each one of them. Keywords: programming languages, programming paradigms, language features, language design and implementation 1 Introduction Choosing the best language that would satisfy all requirements for the given problem domain can be a difficult task. Some languages are better suited for specific applications than others. In order to select the proper one for the specific problem domain, one has to know what features it provides to support the requirements. Different languages support different paradigms, provide different abstractions, and have different levels of expressive power. Some are better suited to express algorithms and others are targeting the non-technical users. The question is then what is the best tool for a particular problem.
    [Show full text]
  • Declarative Programming
    Maria Alpuente Roberto Barbuti Isidro Ramos (Eds.) Declarative Programming 1994 Joint Conference, GULP-PRODE'94 Peiiiscola, Spain, September 19-22, 1994 Proceedings Volume I GULP -PRODE'94 SPUPV-9 4.2046 UNIVERSIOAD POLITtCNICA DE VALENCIA Foreword 'l'ht· Gruppo Ricerca.tori ed utenti di Logic Programming (GULP, which stands l••t Lul(ic Programmjng Researcher and User Group), is an affiliate of the Association 11 1 l.oKk Programming (ALP). The goals of the group are to make logic programming u1m1l popular and to create opporturuties for the exchange of experiences and infor­ ttllltiOn between researchers and users working in the area for both public and private •ur,n niv.ntions. 'J'o this purpose GULP promotes many different activities such as the exchange of 111 f••r111al.ion among its members and the orgaruzation of workshops, advanced ;chools 1111rl il.r; aunual Conference. 'l'hi"s time the Conference is going to be held in Spain together with the Spanish ( :11 ufercnce PRODE on Declarative Programming. This represents a significative step l11warrls the exchange of research experience among European latin countries. Such a w•nl had already been pursued by GULP with the enlargement of its conferences to ~pu ni s h and French researchers. Tile main aims of this Conference are: 1) to serve as an occasion for those working i11 this area which are interested in meeting and exchanging experiences; 2) to illustrate I l11• current state of the art in the area through invited talks given by well known lt'HCarchers; 3) to enable students and researchers to learn more about logic and declarative programming by means of introductory tutorials.
    [Show full text]
  • Programming Paradigms Lecture
    The Beauty and Joy of Computing Lecture #5 Programming Paradigms UC Berkeley EECS Guest Lecturer TA Peter Sujan CITRIS INVENTION LAB! 3D PRINTED GUNS! It provides prototyping resources Is gun control a fruitless effort? such as 3D printing, laser cutting, soldering stations, hand and power tools. We are opening the lab to a limited number of students, staff & faculty to work on outside projects. invent.citris-uc.org motherboard.vice.com/read/click-print-gun-the-inside-story-of-the-3d-printed-gun-movement-video Programming Paradigms Lecture . What are they? Most are Hybrids! . The Four Primary ones Functional Imperative Object-Oriented OOP Example: Skecthpad Declarative . Turing Completeness . Summary en.wikipedia.org/wiki/Programming_paradigm What are Programming Paradigms? . “The concepts and abstractions used to represent the elements of a program (e.g., objects, functions, variables, constraints, etc.) and the steps that compose a computation (assignation, evaluation, continuations, data flows, etc.).” . Or, a way to classify the style of programming. snap.berkeley.edu Of 4 paradigms, how many can Snap! be? a) 1 (functional) b) 1 (not functional) c) 2 d) 3 e) 4 Most Languages Are Hybrids! . This makes it hard to teach to students, because most languages have facets of several paradigms! Called “Multi-paradigm” languages Scratch too! . It’s like giving someone a juice drink (with many fruit in it) and asking to taste just one fruit! en.wikipedia.org/wiki/Functional_programming Functional Programming (review) . Computation is the evaluation of functions f(x)=(x+3)* x Plugging pipes together Each pipe, or function, has x exactly 1 output Functions can be input! .
    [Show full text]