LP Based Integration of Computing and Science Education in Middle Schools

Total Page:16

File Type:pdf, Size:1020Kb

LP Based Integration of Computing and Science Education in Middle Schools LP Based Integration of Computing and Science Education in Middle Schools Yuanlin Zhang Jianlan Wang Texas Tech University Texas Tech University [email protected] [email protected] Fox Bolduc William G. Murray Texas Tech University Texas Tech University [email protected] [email protected] ABSTRACT To develop effective, integrative curriculum, it is desirable tohave There is a consensus on integrating computing with STEM teaching frameworks on how CT can be integrated to STEM education to in K-12. However, very little is known about the integration. In support both CT and STEM curricular topics and students’ learning this paper, we propose a novel framework for integrating science outcomes. and computational thinking teaching using Logic Programming. In this paper we propose a Logic Programming (LP) based frame- We then develop and implement two 8-session integration mod- work for integration, called LPK12. LPK12 achieves a deep integra- ules on chemistry and physics for 6th and 7th graders. Pre- and tion of CT and STEM education by building computer models for post- tests, class observations and interviews show the feasibility STEM problems through Answer Set Programming (ASP) [15] – a of the framework in terms of 1) development and implementation modern LP paradigm. LPK12 is based on the following arguments. of the modules, and 2) the students’ learning outcomes on science First, LP has low floor and high ceiling [32]. It allows students to content and Computational Thinking, and their acceptance of the start developing computer models for interesting, non-trivial STEM integration. problems after a very short introduction and yet it is a full-fledged programming paradigm. Second, LP facilitates a unified treatment CCS CONCEPTS of the fundamental skills and topics in STEM and Computing thanks to the fact that LP is based on discoveries and ideas of Logic which • Social and professional topics → Computational thinking; forms an important base for learning and problem solving in all K-12 education; • Computing methodologies → Logic pro- STEM disciplines. The LP modeling methodology allows a natural gramming and answer set programming. and seamless connection of subject-matter concepts and reasoning KEYWORDS to computer model development. Thirdly, middle school students are cognitively ready for LP based approaches. By Piaget [33] and Logic Programming, Middle School Science, Computing Vygotsky [44], children at age 11 to 15 demonstrate substantial ACM Reference Format: knowledge of natural language and the logical use of symbols re- Yuanlin Zhang, Jianlan Wang, Fox Bolduc, and William G. Murray. 2019. LP lated to abstract concepts. Finally, for STEM, LPK12 facilitates stu- Based Integration of Computing and Science Education in Middle Schools. dents to develop fundamental skills, as defined in next generation In ACM Global Computing Education Conference 2019 (CompEd ’19), May science standards (NGSS) [30], such as asking questions and defining 17–19, 2019, Chengdu, Sichuan, China. ACM, New York, NY, USA, 7 pages. problems, constructing explanations, engaging in argumentation, and https://doi.org/10.1145/3300115.3309512 communicating information. For Computing, students will get abun- 1 INTRODUCTION dant opportunities to learn and practice various levels of abstraction, problem solving, programming and communication as identified in There is consensus on the need of integrating computing, integral the K-12 Computer Science Framework [22]. to the practice of all other STEM disciplines, in STEM teaching and The rest of the paper is organized as follows. We present the learning in K-12 (Kindergarten to 12th grade in the US education LPK12 framework in Section 2 before the discussion of the related system) (see, e.g., [31, 41]). However, little is known about how best work in Section 3. In Section 4, we introduce the design of the study Computational Thinking (CT) can be taught and how to integrate of the feasibility of LPK12 and the procedure of data collection and it with STEM disciplines to improve STEM and CT learning in K-12 analysis. In Section 5, we present the data in alignment with our in general and middle schools in particular. research questions. The paper is concluded by the last section. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation 2 THEORETICAL FRAMEWORK on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, 2.1 LP Based Integration of Computing and to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]. Science Teaching CompEd’19, May 17 – 19, 2019, Chengdu, Sichuan, China To integrate STEM and Computing teaching, we employ a method- © 2019 Association for Computing Machinery. ACM ISBN 978-1-4503-6259-7/19/05...$15.00 ology with two (often iterative) sequential components: (1) Prob- https://doi.org/10.1145/3300115.3309512 lem Description. Teach students a new or learned STEM topic (problem). Students are expected to answer basic questions in this Y is extinct. (Note: the rule is an accurate representation of the topic and understand why. (2) Modeling. Ask students to build a knowledge in food chains, but needs to be refined when a food computer model using LP. The model is expected to answer the web is modeled.) With these newly added rules, the LP program questions in the problem descriptions. concludes that eagles are extinct too. We will use food chain as an example to illustrate both the We have covered almost all major constructs of ASP. We hope the methodology and LP. examples demonstrate the simplicity of ASP and the naturalness of the modeling and how the modeling focuses on domain knowledge. Problem description. Food chains are a science topic taught in One can also see that LP, together with its modeling methodology, middle school. Consider a chain with carrots, rabbits, snakes and produces a seamless integration of Science and Computing. eagles. Typical questions include “Q1: do eagles eat snakes?” and “Q2: what would happen to eagles if snakes become extinct?” Stu- dents are expected to review or learn food chains and how these 2.2 LPK12 Facilitates STEM and CT Learning questions can be answered. Model-based learning is well accepted in science education. It is Modeling. To design a computer model to answer the questions anticipated to help students’ “attainment of ’conceptual under- above, we follow an LP modeling methodology which consists of standing’ in science at a level that goes beyond memorized facts, two steps. (1) Identify objects and relations in the problem. (2) Iden- equations, or procedures” [5]. It is well recognized that building tify knowledge in the problem and write LP rules for this knowledge. computer models for STEM problems helps STEM education too The final LP rules, also called a program, form the model of the [10, 16, 19, 21, 35, 40, 45]. In fact, Harel and Papert [19] pointed out problem. that learning computing together with another subject can be more Objects of the food chain problem. The objects here are four effective than learning each separately. species of organisms, which can be represented in LP by the fol- To illustrate how LP-based integration will facilitate STEM learn- lowing sort declaration: ing, we use the framework for K-12 science education[11]. The #species = {eagle, snake, rabbit, carrot}. framework articulates a vision of the scope and nature of K-12 Note that each species is taken as an object here. #species is education in Science, engineering, and technology. It has been imple- called a sort name. mented by NGSS (Next Generation Science Standards) which has Relations in the food chain problem. From question Q1, we iden- been adopted by 16 states in US. tify a relation of the form f eedsOn(X;Y ) meaning that members of The NGSS framework divides the fundamental, core skills for sci- species X feed on those of species Y . In question Q2, we introduce a ence, engineering and technology into eight practices. SP1: asking relation extinct (X ) which means that species X is extinct. questions and defining problems. SP2: developing and using mod- Knowledge and LP Rules. In this part, we explicate the science els. SP3: planning and carrying out investigations. SP4: analyzing knowledge needed to answer the questions in English and then and interpreting data. SP5: using mathematics and Computational “translate” that knowledge into LP rules. The declarative nature Thinking. SP6: constructing explanations and designing solutions. of LP allows for a natural translation. For example, in the given SP7: engaging in argument from evidence. SP8: Obtaining, evaluat- food chain, we know that “rabbits feed on carrots”, which can be ing, and communicating information. translated, using the relation introduced earlier, into LPK12 is able to cover the majority of the eight practices. As r1 : f eedsOn(rabbit;carrot): shown in our integration example in Section 2, students have to ask which is called a fact, a simplest form of an LP rule. r1 is the and answer questions before building a computer model. Hence, label of the rule which may be referred to later. Similarly, we SP1 is in a prominent position in LPK12. LPK12 is driven by de- have the knowledge that “snakes feed on rabbits” and “eagles veloping computer models for STEM problems and thus SP2 will feed on snakes” which are translated respectively into the facts: be practiced intensively under our integration methodology. In r2 : f eedsOn(snake;rabbit) and r3 : f eedsOn(eaдle;snake): The LPK12, as shown in Section 2.1, students are encouraged to iden- collection of rules above forms an LP program which can be used to tify the knowledge and represent it as rules for computer models.
Recommended publications
  • Compiler Error Messages Considered Unhelpful: the Landscape of Text-Based Programming Error Message Research
    Working Group Report ITiCSE-WGR ’19, July 15–17, 2019, Aberdeen, Scotland Uk Compiler Error Messages Considered Unhelpful: The Landscape of Text-Based Programming Error Message Research Brett A. Becker∗ Paul Denny∗ Raymond Pettit∗ University College Dublin University of Auckland University of Virginia Dublin, Ireland Auckland, New Zealand Charlottesville, Virginia, USA [email protected] [email protected] [email protected] Durell Bouchard Dennis J. Bouvier Brian Harrington Roanoke College Southern Illinois University Edwardsville University of Toronto Scarborough Roanoke, Virgina, USA Edwardsville, Illinois, USA Scarborough, Ontario, Canada [email protected] [email protected] [email protected] Amir Kamil Amey Karkare Chris McDonald University of Michigan Indian Institute of Technology Kanpur University of Western Australia Ann Arbor, Michigan, USA Kanpur, India Perth, Australia [email protected] [email protected] [email protected] Peter-Michael Osera Janice L. Pearce James Prather Grinnell College Berea College Abilene Christian University Grinnell, Iowa, USA Berea, Kentucky, USA Abilene, Texas, USA [email protected] [email protected] [email protected] ABSTRACT of evidence supporting each one (historical, anecdotal, and empiri- Diagnostic messages generated by compilers and interpreters such cal). This work can serve as a starting point for those who wish to as syntax error messages have been researched for over half of a conduct research on compiler error messages, runtime errors, and century. Unfortunately, these messages which include error, warn- warnings. We also make the bibtex file of our 300+ reference corpus ing, and run-time messages, present substantial difficulty and could publicly available.
    [Show full text]
  • How to Design Co-Programs
    JFP, 15 pages, 2021. c Cambridge University Press 2021 1 doi:10.1017/xxxxx EDUCATIONMATTERS How to Design Co-Programs JEREMY GIBBONS Department of Computer Science, University of Oxford e-mail: [email protected] Abstract The observation that program structure follows data structure is a key lesson in introductory pro- gramming: good hints for possible program designs can be found by considering the structure of the data concerned. In particular, this lesson is a core message of the influential textbook “How to Design Programs” by Felleisen, Findler, Flatt, and Krishnamurthi. However, that book discusses using only the structure of input data for guiding program design, typically leading towards structurally recur- sive programs. We argue that novice programmers should also be taught to consider the structure of output data, leading them also towards structurally corecursive programs. 1 Introduction Where do programs come from? This mystery can be an obstacle to novice programmers, who can become overwhelmed by the design choices presented by a blank sheet of paper, or an empty editor window— where does one start? A good place to start, we tell them, is by analyzing the structure of the data that the program is to consume. For example, if the program h is to process a list of values, one may start by analyzing the structure of that list. Either the list is empty ([]), or it is non-empty (a : x) with a head (a) and a tail (x). This provides a candidate program structure: h [ ] = ::: h (a : x) = ::: a ::: x ::: where for the empty list some result must simply be chosen, and for a non-empty list the result depends on the head a and tail x.
    [Show full text]
  • Panel: NSF-Sponsored Innovative Approaches to Undergraduate Computer Science
    Panel: NSF-Sponsored Innovative Approaches to Undergraduate Computer Science Stephen Bloch (Adelphi University) Amruth Kumar (Ramapo College) Stanislav Kurkovsky (Central CT State University) Clif Kussmaul (Muhlenberg College) Matt Dickerson (Middlebury College), moderator Project Web site(s) Intervention Delivery Supervision Program http://programbydesign.org curriculum with supporting in class; software normally active, but can be by Design http://picturingprograms.org IDE, libraries, & texts and textbook are done other ways Stephen Bloch http://www.ccs.neu.edu/home/ free downloads matthias/HtDP2e/ or web-based NSF awards 0010064 http://racket-lang.org & 0618543 http://wescheme.org Problets http://www.problets.org in- or after-class problem- applet in none - teacher not needed, Amruth Kumar solving exercises on a browser although some adopters use programming concepts it in active mode too NSF award 0817187 Mobile Game http://www.mgdcs.com/ in-class or take-home PC passive - teacher as Development programming projects facilitator to answer Qs Stan Kurkovsky NSF award DUE-0941348 POGIL http://pogil.org in-class activity paper or web passive - teacher as Clif Kussmaul http://cspogil.org facilitator to answer Qs NSF award TUES 1044679 Project Course(s) Language(s) Focus Program Middle school, Usually Scheme-like teaching problem-solving process, by pre-AP CS in HS, languages leading into Java; particularly test-driven DesignStephen CS0, CS1, CS2 has also been done in Python, development and use of data Bloch in college ML, Java, Scala, ... types to guide coding & testing Problets AP-CS, CS I, CS 2. C, C++, Java, C# code tracing, debugging, Amruth Kumar also as refresher or expression evaluation, to switch languages predicting program state in other courses Mobile Game AP-CS, CS1, CS2 Java core OO programming; DevelopmentSt intro to advanced subjects an Kurkovsky such as AI, networks, security POGILClif CS1, CS2, SE, etc.
    [Show full text]
  • Final Shift for Call/Cc: Direct Implementation of Shift and Reset
    Final Shift for Call/cc: Direct Implementation of Shift and Reset Martin Gasbichler Michael Sperber Universitat¨ Tubingen¨ fgasbichl,[email protected] Abstract JxKρ = λk:(k (ρ x)) 0 0 We present a direct implementation of the shift and reset con- Jλx:MKρ = λk:k (λv:λk :(JMK)(ρ[x 7! v]) k ) trol operators in the Scheme 48 system. The new implementation JE1 E2Kρ = λk:JE1Kρ (λ f :JE2Kρ (λa: f a k) improves upon the traditional technique of simulating shift and reset via call/cc. Typical applications of these operators exhibit Figure 1. Continuation semantics space savings and a significant overall performance gain. Our tech- nique is based upon the popular incremental stack/heap strategy for representing continuations. We present implementation details as well as some benchmark measurements for typical applications. this transformation has a direct counterpart as a semantic specifica- tion of the λ calculus; Figure 1 shows such a semantic specification for the bare λ calculus: each ρ is an environment mapping variables Categories and Subject Descriptors to values, and each k is a continuation—a function from values to values. An abstraction denotes a function from an environment to a D.3.3 [Programming Languages]: Language Constructs and Fea- function accepting an argument and a continuation. tures—Control structures In the context of the semantics, the rule for call/cc is this: General Terms Jcall=cc EKρ = λk:JEKρ (λ f : f (λv:λk0:k v) k) Languages, Performance Call=cc E evaluates E and calls the result f ; it then applies f to an Keywords escape function which discards the continuation k0 passed to it and replaces it by the continuation k of the call=cc expression.
    [Show full text]
  • The Next 700 Semantics: a Research Challenge Shriram Krishnamurthi Brown University [email protected] Benjamin S
    The Next 700 Semantics: A Research Challenge Shriram Krishnamurthi Brown University [email protected] Benjamin S. Lerner Northeastern University [email protected] Liam Elberty Unaffiliated Abstract Modern systems consist of large numbers of languages, frameworks, libraries, APIs, and more. Each has characteristic behavior and data. Capturing these in semantics is valuable not only for understanding them but also essential for formal treatment (such as proofs). Unfortunately, most of these systems are defined primarily through implementations, which means the semantics needs to be learned. We describe the problem of learning a semantics, provide a structuring process that is of potential value, and also outline our failed attempts at achieving this so far. 2012 ACM Subject Classification Software and its engineering → General programming languages; Software and its engineering → Language features; Software and its engineering → Semantics; Software and its engineering → Formal language definitions Keywords and phrases Programming languages, desugaring, semantics, testing Digital Object Identifier 10.4230/LIPIcs.SNAPL.2019.9 Funding This work was partially supported by the US National Science Foundation and Brown University while all authors were at Brown University. Acknowledgements The authors thank Eugene Charniak and Kevin Knight for useful conversations. The reviewers provided useful feedback that improved the presentation. © Shriram Krishnamurthi and Benjamin S. Lerner and Liam Elberty; licensed under Creative Commons License CC-BY 3rd Summit on Advances in Programming Languages (SNAPL 2019). Editors: Benjamin S. Lerner, Rastislav Bodík, and Shriram Krishnamurthi; Article No. 9; pp. 9:1–9:14 Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany 9:2 The Next 700 Semantics: A Research Challenge 1 Motivation Semantics is central to the trade of programming language researchers and practitioners.
    [Show full text]
  • Proceedings of the 8Th European Lisp Symposium Goldsmiths, University of London, April 20-21, 2015 Julian Padget (Ed.) Sponsors
    Proceedings of the 8th European Lisp Symposium Goldsmiths, University of London, April 20-21, 2015 Julian Padget (ed.) Sponsors We gratefully acknowledge the support given to the 8th European Lisp Symposium by the following sponsors: WWWLISPWORKSCOM i Organization Programme Committee Julian Padget – University of Bath, UK (chair) Giuseppe Attardi — University of Pisa, Italy Sacha Chua — Toronto, Canada Stephen Eglen — University of Cambridge, UK Marc Feeley — University of Montreal, Canada Matthew Flatt — University of Utah, USA Rainer Joswig — Hamburg, Germany Nick Levine — RavenPack, Spain Henry Lieberman — MIT, USA Christian Queinnec — University Pierre et Marie Curie, Paris 6, France Robert Strandh — University of Bordeaux, France Edmund Weitz — University of Applied Sciences, Hamburg, Germany Local Organization Christophe Rhodes – Goldsmiths, University of London, UK (chair) Richard Lewis – Goldsmiths, University of London, UK Shivi Hotwani – Goldsmiths, University of London, UK Didier Verna – EPITA Research and Development Laboratory, France ii Contents Acknowledgments i Messages from the chairs v Invited contributions Quicklisp: On Beyond Beta 2 Zach Beane µKanren: Running the Little Things Backwards 3 Bodil Stokke Escaping the Heap 4 Ahmon Dancy Unwanted Memory Retention 5 Martin Cracauer Peer-reviewed papers Efficient Applicative Programming Environments for Computer Vision Applications 7 Benjamin Seppke and Leonie Dreschler-Fischer Keyboard? How quaint. Visual Dataflow Implemented in Lisp 15 Donald Fisk P2R: Implementation of
    [Show full text]
  • Application and Interpretation
    Programming Languages: Application and Interpretation Shriram Krishnamurthi Brown University Copyright c 2003, Shriram Krishnamurthi This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 United States License. If you create a derivative work, please include the version information below in your attribution. This book is available free-of-cost from the author’s Web site. This version was generated on 2007-04-26. ii Preface The book is the textbook for the programming languages course at Brown University, which is taken pri- marily by third and fourth year undergraduates and beginning graduate (both MS and PhD) students. It seems very accessible to smart second year students too, and indeed those are some of my most successful students. The book has been used at over a dozen other universities as a primary or secondary text. The book’s material is worth one undergraduate course worth of credit. This book is the fruit of a vision for teaching programming languages by integrating the “two cultures” that have evolved in its pedagogy. One culture is based on interpreters, while the other emphasizes a survey of languages. Each approach has significant advantages but also huge drawbacks. The interpreter method writes programs to learn concepts, and has its heart the fundamental belief that by teaching the computer to execute a concept we more thoroughly learn it ourselves. While this reasoning is internally consistent, it fails to recognize that understanding definitions does not imply we understand consequences of those definitions. For instance, the difference between strict and lazy evaluation, or between static and dynamic scope, is only a few lines of interpreter code, but the consequences of these choices is enormous.
    [Show full text]
  • Practical Ruby Projects: Practical Ruby Projects Ideas for the Eclectic Programmer
    CYAN YELLOW MAGENTA BLACK PANTONE 123 C BOOKS FOR PROFESSIONALS BY PROFESSIONALS® THE EXPERT’S VOICE® IN OPEN SOURCE Companion eBook Available Practical Ruby Projects: Projects Ruby Practical Ideas for the Eclectic Programmer Dear Reader, You’ve learned the basics of Ruby, and you’re ready to move on to the next level— trying out advanced techniques, mastering best practices, and exploring Ruby’s full potential. With this book you’ll learn by experience while you tackle an exciting series of varied but always practical programming projects. What is an eclectic programmer, you ask? He or she is an inquisitive thinker Practical who likes to play around with new concepts, a person who is project-oriented and enjoys coding, a person who doesn’t mind some technical depth folded in with creative excursions, and a person who is always looking for fresh ideas. This book is a little different from other computer books. It is meant to be entertaining, exciting, and intellectually challenging. Inside you’ll find a collec- tion of diverse projects, ranging from the creative to the practical, written as a nod to all the great Rubyists I’ve been privileged to know. Each chapter dives into Ruby Projects new topics and approaches meant to exercise your programming muscles. You’ll start by building a cross-platform music environment, progress to drawing animations using scalable vector graphics, and then move on to prac- tical problem solving using simulation. In addition, you’ll implement your own turn-based strategy game and build a Mac-native RubyCocoa interface to it.
    [Show full text]
  • Programming Languages As Operating Systems (Or Revenge of the Son of the Lisp Machine)
    Programming Languages as Operating Systems (or Revenge of the Son of the Lisp Machine) Matthew Flatt Robert Bruce Findler Shriram Krishnamurthi Matthias Felleisen Department of Computer Science∗ Rice University Houston, Texas 77005-1892 Abstract reclaim the program’s resources—even though the program and DrScheme share a single virtual machine. The MrEd virtual machine serves both as the implementa- To address this problem, MrEd provides a small set of tion platform for the DrScheme programming environment, new language constructs. These constructs allow a program- and as the underlying Scheme engine for executing expres- running program, such as DrScheme, to run nested programs sions and programs entered into DrScheme’s read-eval-print directly on the MrEd virtual machine without sacrificing loop. We describe the key elements of the MrEd virtual control over the nested programs. As a result, DrScheme machine for building a programming environment, and we can execute a copy of DrScheme that is executing its own step through the implementation of a miniature version of copy of DrScheme (see Figure 1). The inner and middle DrScheme in MrEd. More generally, we show how MrEd de- DrSchemes cannot interfere with the operation of the outer fines a high-level operating system for graphical programs. DrScheme, and the middle DrScheme cannot interfere with the outer DrScheme’s control over the inner DrScheme. 1 MrEd: A Scheme Machine In this paper, we describe the key elements of the MrEd virtual machine, and we step through the implementation The DrScheme programming environment [10] provides stu- of a miniature version of DrScheme in MrEd.
    [Show full text]
  • A Python Implementation for Racket
    PyonR: A Python Implementation for Racket Pedro Alexandre Henriques Palma Ramos Thesis to obtain the Master of Science Degree in Information Systems and Computer Engineering Supervisor: António Paulo Teles de Menezes Correia Leitão Examination Committee Chairperson: Prof. Dr. José Manuel da Costa Alves Marques Supervisor: Prof. Dr. António Paulo Teles de Menezes Correia Leitão Member of the Committee: Prof. Dr. João Coelho Garcia October 2014 ii Agradecimentos Agradec¸o... Em primeiro lugar ao Prof. Antonio´ Leitao,˜ por me ter dado a oportunidade de participar no projecto Rosetta com esta tese de mestrado, por todos os sabios´ conselhos e pelos momentos de discussao˜ e elucidac¸ao˜ que se proporcionaram ao longo deste trabalho. Aos meus pais excepcionais e a` minha mana preferida, por me terem aturado e suportado ao longo destes quase 23 anos e sobretudo pelo incondicional apoio durante estes 5 anos de formac¸ao˜ superior. Ao pessoal do Grupo de Arquitectura e Computac¸ao˜ (Hugo Correia, Sara Proenc¸a, Francisco Freire, Pedro Alfaiate, Bruno Ferreira, Guilherme Ferreira, Inesˆ Caetano e Carmo Cardoso), por todas as sug- estoes˜ e pelo inestimavel´ feedback em artigos e apresentac¸oes.˜ Aos amigos em Tomar (Rodrigo Carrao,˜ Hugo Matos, Andre´ Marques e Rui Santos) e em Lisboa (Diogo da Silva, Nuno Silva, Pedro Engana, Kaguedes, Clara Paiva e Odemira), por terem estado pre- sentes, duma forma ou doutra, nos essenciais momentos de lazer. A` Fundac¸ao˜ para a Cienciaˆ e Tecnologia (FCT) e ao INESC-ID pelo financiamento e acolhimento atraves´ da atribuic¸ao˜ de uma bolsa de investigac¸ao˜ no ambitoˆ dos contratos Pest-OE/EEI/LA0021/2013 e PTDC/ATP-AQI/5224/2012.
    [Show full text]
  • Extensible Type-Directed Editing
    Extensible Type-Directed Editing Joomy Korkut David Thrane Christiansen Wesleyan University Galois, Inc. Middletown, Connecticut, USA Portland, Oregon, USA [email protected] [email protected] Abstract their respective compilers, and skill in dependently typed Dependently typed programming languages, such as Idris programming does not imply the ability to extend the im- and Agda, feature rich interactive environments that use plementation of dependently typed languages and maintain informative types to assist users with the construction of those extensions so that they continue to work as compilers programs. However, these environments have been provided are improved. by the authors of the language, and users have not had an The Idris elaborator [7] translates programs written in easy way to extend and customize them. We address this Idris into a smaller core type theory, called TT. The elab- problem by extending Idris’s metaprogramming facilities orator is written in Haskell, making use of an elaboration with primitives for describing new type-directed editing fea- monad to track the complicated state that is involved. The tures, making Idris’s editors as extensible as its elaborator. high-level Idris language is extensible using elaborator reflec- tion [8, 10], which directly exposes the elaboration monad CCS Concepts • Software and its engineering → Func- to Idris programs so that Idris can be extended in itself. Con- tional languages; Language features; cretely, elaborator reflection extends Idris with a primitive Keywords Metaprogramming, dependent types, editors monad Elab. Just as IO values describe effectful programs to be executed by the run-time system, Elab values describe ACM Reference Format: effectful programs to be run during elaboration.
    [Show full text]
  • The Racket Manifesto∗
    The Racket Manifesto∗ Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi Eli Barzilay, Jay McCarthy, Sam Tobin-Hochstadt Abstract The creation of a programming language calls for guiding principles that point the developers to goals. This article spells out the three basic principles behind the 20-year development of Racket. First, programming is about stating and solving problems, and this activity normally takes place in a context with its own language of discourse; good programmers ought to for- mulate this language as a programming language. Hence, Racket is a programming language for creating new programming languages. Second, by following this language-oriented approach to programming, systems become multi-lingual collections of interconnected components. Each language and component must be able to protect its specific invariants. In support, Racket offers protection mechanisms to implement a full language spectrum, from C-level bit manipulation to soundly typed extensions. Third, because Racket considers programming as problem solving in the correct language, Racket also turns extra-linguistic mechanisms into linguistic constructs, especially mechanisms for managing resources and projects. The paper explains these principles and how Racket lives up to them, presents the evaluation framework behind the design process, and concludes with a sketch of Racket’s imperfections and opportunities for future improvements. 1998 ACM Subject Classification D.3.3 Language Constructs and Features Keywords and phrases design
    [Show full text]