Filters








114 Hits in 5.3 sec

Lambda: the ultimate sublanguage (experience report)

Jeremy Yallop, Leo White
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
We describe our experience teaching an advanced typed functional programming course based around the use of System Fω as a programming language.  ...  Anil Madhavapeddy, Heidi Howard and, of course, the Advanced Computer Science students who participated in the course over the past few years and provided valuable feedback.  ...  Finally, we thank the ICFP'19 reviewers for helpful comments.  ... 
doi:10.1145/3342713 fatcat:6hv3lrjfwnh4vcitzsodczjrhy

One down, 699 to go: or, synthesising compositional desugarings

Sándor Bartha, James Cheney, Vaishak Belle
2021 Proceedings of the ACM on Programming Languages (PACMPL)  
In this paper, we highlight that scaling methods with the size of the language is very difficult due to state space explosion, so we propose to learn semantics incrementally.  ...  We evaluate enumerative synthesis as a baseline algorithm, and demonstrate that, with our reformulation of the problem, it is possible to learn correct desugaring rules for the example source and core  ...  We also thank the artifact evaluators and AEC chairs for allowing us to update our artifact submission to reflect the final version of the paper.  ... 
doi:10.1145/3485499 fatcat:r6huc2mlljgvxiymli4q5xtdgi

One Down, 699 to Go: or, synthesising compositional desugarings [article]

Sándor Bartha and James Cheney and Vaishak Belle
2021 arXiv   pre-print
In this paper, we highlight that scaling methods with the size of the language is very difficult due to state space explosion, so we propose to learn semantics incrementally.  ...  We evaluate enumerative synthesis as a baseline algorithm, and demonstrate that, with our reformulation of the problem, it is possible to learn correct desugaring rules for the example source and core  ...  We also thank the artifact evaluators and AEC chairs for allowing us to update our artifact submission to reflect the final version of the paper.  ... 
arXiv:2109.06114v1 fatcat:hja4ks7gp5aehlmw4kyau2p4fm

A customizable substrate for concurrent languages

Suresh Jagannathan, Jim Philbin
1992 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation - PLDI '92  
The Revised3 Report on the Algorithmic Language Scheme. Concurrent Lan- guage.  ...  When the mutexis ultimately released, (via mutex-release) all threads blocked on this mutex are restored onto some ready queue.  ... 
doi:10.1145/143095.143119 dblp:conf/pldi/JagannathanP92 fatcat:n5r3kuimjvhjfim7xc53qjkf4u

Estimating the Cost of Native Method Calls for Resource-bounded Functional Programming Languages

Stephen Gilmore, Olha Shkaravska
2006 Electronical Notes in Theoretical Computer Science  
We supplement the syntactic type inference procedure of the functional language with a separate analysis which estimates the costs of memory leaks incurred by calls to garbage collection-ignorant functions  ...  We consider the application of a functional language with a high-level type system which incorporates measures of heap space consumption in types on such an execution platform.  ...  The MRG project is funded under the Global Computing pro-active initiative of the Future and Emerging Technologies part of the Information Society Technologies programme of the European Commission's Fifth  ... 
doi:10.1016/j.entcs.2006.03.010 fatcat:xf6k25wxtrgwxbkrnzrkkhw7pm

Programming language foundations in Agda

Wen Kokke, Jeremy G. Siek, Philip Wadler
2020 Science of Computer Programming  
We are convinced by the claim of Pierce (2009) , made in his ICFP Keynote Lambda, The Ultimate TA, that basing a course around a proof assistant aids learning.  ...  As an experiment, Philip first rewrote SF's development of simply-typed lambda calculus (SF, Chapters Stlc and StlcProp) in Agda.  ...  ☐ The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.  ... 
doi:10.1016/j.scico.2020.102440 fatcat:czwjxx35krfvtclrrmor4gwziy

Databases and Natural Language Processing

Zenon W. Pylyshyn, Richard I. Kittredge
1985 IEEE Data Engineering Bulletin  
In presenting this overview, we have concentrated on those design aspects that were most constrained by the requirements of transportability. 1  ...  Warren also contributed to the project.9 Acknowledgments This work is based on several studies in cooperation with the IBM  ...  Robinson, and Daniel Sagalowicz played important roles in the design of TEAM. Armar Archbold, Norman Haas, Gary Hendrix, Lorna Shinkle, Mark Stickel and David H.  ... 
dblp:journals/debu/PylyshynK85 fatcat:szpcsvhph5cwhf65f5c3a4gf4e

Functional-logic integration via minimal reciprocal extensions

Harold Boley
1999 Theoretical Computer Science  
The compiler system reuses the register Xl of the Warren Abstract Machine for value returning, statically flattening general nestings while optimizing first-argument nestings.  ...  Procedural and model-theoretic semantics are developed for kernel RELFUN, transferring the Herbrand models of (Horn-clause) relational programming to (first-order) functional programming.  ...  However, rather than abandoning Herbrand models [24] in favor of, say, Henkin models [25], our functional sublanguage only permits functions named by terms (constants or structures), not anonymous (lambda  ... 
doi:10.1016/s0304-3975(98)00136-4 fatcat:4m27snfcwnaxjpmknlysaqcu4y

A direct approach to control-flow sensitive region-based memory management

Fritz Henglein, Henning Makholm, Henning Niss
2001 Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '01  
In this paper we present the design of our region type system, illustrate its practical expressiveness, compare it to existing region analyses, demonstrate how this eliminates the need for previously required  ...  We present a unified Floyd-Hoare Logic inspired region type system for reasoning about and inferring region-based memory management, using a sublanguage of imperative region commands.  ...  Recent research shows how such systems can be represented in the monadic lambda calculus [17, 10] .  ... 
doi:10.1145/773184.773203 dblp:conf/ppdp/HengleinMN01 fatcat:turk4woxrvh7dk6zhuarodxkey

Semantic Bootstrapping of Type-Logical Grammar

Sean A. Fulop
2005 Journal of Logic, Language and Information  
A generalized formulae-as-types correspondence is exploited to obtain all the typelogical proofs of the sample sentences from their lambda terms, and the resulting lexicons are then optimally unified,  ...  A procedure is described which induces type-logical grammar lexicons from sentences annotated with skeletal terms of the simply typed lambda calculus.  ...  Let Λ NL denote the largest sublanguage of the simply typed lambda language each of whose terms N conform to the following constraints: 1. Term N may not contain "vacuous abstraction," 2.  ... 
doi:10.1007/s10849-005-4509-8 fatcat:c2pobujgjbci5jawmx6e65gt64

Semantic bootstrapping of type-logical grammar

Sean A. Fulop
2004 Journal of Logic, Language and Information  
A generalized formulae-as-types correspondence is exploited to obtain all the typelogical proofs of the sample sentences from their lambda terms, and the resulting lexicons are then optimally unified,  ...  A procedure is described which induces type-logical grammar lexicons from sentences annotated with skeletal terms of the simply typed lambda calculus.  ...  Let Λ NL denote the largest sublanguage of the simply typed lambda language each of whose terms N conform to the following constraints: 1. Term N may not contain "vacuous abstraction," 2.  ... 
doi:10.1007/s10849-004-4509-0 fatcat:rw4jroblnbd2foqk72wyfd6bqu

Verischemelog

James Jennings, Eric Beuscher
1999 Proceedings of the 2nd conference on Domain-specific languages - PLAN '99  
Preprocessors for Verilog, on the other hand, are hampered by their macroexpansion languages, which support few data types and lack procedures.  ...  Verischemelog obviates the need for scripts and preprocessors by providing a hardware description language with list-based syntax, and Scheme to manipulate it.  ...  Acknowledgments The source code, grammar, examples including the Turing Machine and design documents of Verischemelog are available on the web from http: www.eecs.tulane.edu www Jennings.  ... 
doi:10.1145/331960.331978 dblp:conf/dsl/JenningsB99 fatcat:lue65yzbencyfkbhiqlnmyhu5u

Verischemelog

James Jennings, Eric Beuscher
2000 SIGPLAN notices  
Preprocessors for Verilog, on the other hand, are hampered by their macroexpansion languages, which support few data types and lack procedures.  ...  Verischemelog obviates the need for scripts and preprocessors by providing a hardware description language with list-based syntax, and Scheme to manipulate it.  ...  Acknowledgments The source code, grammar, examples including the Turing Machine and design documents of Verischemelog are available on the web from http: www.eecs.tulane.edu www Jennings.  ... 
doi:10.1145/331963.331978 fatcat:ebfsqjsje5datc4e2xhg5olgei

Grace

Andrew P. Black, Kim B. Bruce, Michael Homer, James Noble
2012 Proceedings of the ACM international symposium on New ideas, new paradigms, and reflections on programming and software - Onward! '12  
We focus on three of the problems that we encountered, and how we believe we have solved them.  ...  We are engaged in the design of a small, simple programming language for teaching novices object-oriented programming. This turns out to be far from a small, simple task.  ...  Each sublanguage includes the features listed in its box and the union of all of the features of the sublanguages that it contains.  ... 
doi:10.1145/2384592.2384601 dblp:conf/oopsla/BlackBHN12 fatcat:urcg4jfgtjdbxdv6p5xeozifzm

Integrating Access-Oriented Programming into a Multiparadigm Environment

M.J. Stefik, D.G. Bobrow, K.M. Kahn
1986 IEEE Software  
the nested active values will be invoked, and the data will ultimately be stored in the localState of the innermost one.  ...  For active values, this claim ultimately depends on the condition that the user-defined procedures have noninterfering side effects.  ...  Stefik received his PhD from Stanford University in 1980 for his work on the Molgen program. He is the book review editor for the journal Artjflcial Intelligence.  ... 
doi:10.1109/ms.1986.232428 fatcat:wlklrzsnjfd2pd4okxlhajiqgi
« Previous Showing results 1 — 15 out of 114 results