User loginNavigation |
LtU ForumSPLASH 2015 - 2nd Combined Call for Contributions/************************************************************************************/ Pittsburgh, Pennsylvania, USA Sponsored by ACM SIGPLAN /************************************************************************************/ Co-Located Conferences: SLE, GPCE, DBPL, PLoP The ACM SIGPLAN conference on Systems, Programming, Languages and Applications: Software for Humanity (SPLASH) embraces all aspects of software construction and delivery to make it the premier conference at the intersection of programming, languages, and software engineering. SPLASH is now accepting submissions. We invite high quality submissions describing original and unpublished work. Most of the following tracks have submissions due: 30 JUNE ** Demos ** Submissions Due: 30 June, 2015 ** Doctoral Symposium ** Submissions Due: 30 June, 2015 ** Dynamic Languages Symposium (DLS) ** Submissions Due: 15 June, 2015 ** OOPSLA Artifacts ** Submissions Due: 9 June, 2015 ** Posters ** Submissions Due: 30 June, 2015 ** SPLASH-E ** Submissions Due: 30 June, 2015 ** Student Research Competition ** Submissions Due: 30 June, 2015 ** Student Volunteers ** Submissions Due: 7 August, 2015 ** Tutorials ** Submissions Due: 30 June, 2015 ** Wavefront ** Submissions Due: 30 June, 2015 ** Workshops ** Late Phase Submissions Due: 30 June, 2015 ** Co-Located Events ** SLE - 8th International Conference on Software Language Engineering (SLE) GPCE - 14th International Conference on Generative Programming: Concepts & Experiences (GPCE) DBPL - 15th Symposium on Database Programming Languages (DBPL) PLoP - 22nd International Conference on Pattern Languages of Programming (PLoP) Information: Location: Organization: By craiganslow at 2015-06-21 16:20 | LtU Forum | login or register to post comments | other blogs | 2832 reads
The single instruction compilerThe M/o/Vfuscator (short 'o', sounds like "mobfuscator") compiles programs into "mov" instructions, and only "mov" instructions. Arithmetic, comparisons, jumps, function calls, and everything else a program needs are all emulated through movs, and there is no SMC cheating. The compiler is inspired by the paper "mov is Turing-complete", by Stephen Dolan. The original M/o/Vfuscator (M/o/Vfuscator 1.0) compiles programs from the esoteric language BrainF@$!, and is best used in conjunction with the BFBASIC compiler by Jeffry Johnston. M/o/Vfuscator 2.0 is a complete C compiler, and will be available soon. By marco at 2015-06-21 12:11 | LtU Forum | login or register to post comments | other blogs | 3440 reads
Strengthening Process CalculiMingsheng Ying: Topology in process calculus: approximate correctness and infinite evolution of concurrent programs. Since process calculi come up now and then, I borrowed this book from the library and tried to read it. Cannot claim to have grokked it, but I was excited reading through the example applications toward the end of it. I (think I) am hoping this kind of work can find its way into the main-stream somehow, some day.
Good syntax for single argument methods?I'm looking for good non-brace syntax for a single argument method call. I can't use space since it is already taken for infix operations (e.g. x + y vs. draw circle(...)). I was thinking about using hash; e.g. draw#circle(....) where circle is a method that produces a circle shape to draw. Are there any better options that have been tried before? As for why I don't just go with braces, I'm looking for a special syntax to capture "verb on what" in a way that can more easily be read left to right without nesting. VISSOFT 2015 - Call for Papers: New Ideas or Emerging Results and Tool Demos--------------------------------------- 3rd IEEE Working Conference on Software Visualization (VISSOFT) Paper submission date: June 29, 2015 Software visualization is a broad research area encompassing concepts, methods, tools, and techniques that assist in a range of software engineering and software development activities. Covered aspects include the development and evaluation of approaches for visually analyzing software and software systems, including their structure, execution behavior, and evolution. The VISSOFT IEEE Working Conference on Software Visualization continues the history of the ACM SOFTVIS Symposium on Software Visualization and the IEEE VISSOFT International Workshop on Visualizing Software for Understanding and Analysis. The conference focuses on visualization techniques that target aspects of software maintenance and evolution, program comprehension, reverse engineering, and reengineering, i.e., how visualization helps professionals to understand, analyze, test and evolve software. We aim to gather tool developers, experts, users, and researchers from software engineering, information visualization, computer graphics, and human-computer interaction to discuss theoretical foundations, algorithms, techniques, tools, and applications related to software visualization. Topics of interest include, but are not limited to: VISSOFT features a New Ideas or Emerging Results (NIER) track and a Tool Demo track related to the list of topics suggested above. Papers are solicited that present original, unpublished research results and will be rigorously reviewed by an international program committee. The NIER contributions (New Ideas and Emerging Results) describe work-in-progress and preliminary exciting results. Authors should include open questions and even provocative hypotheses to get early feedback on their research ideas or even support through new research collaborations. Tool contributions describe the design or actual utilization of software visualization tools, with a focus on relevant tool construction aspects or the use of the tool for gaining new insights. Authors should be prepared to demonstrate their tool at the conference. The submission may also contain a link to a screencast (video). All accepted submissions will appear in the conference proceedings and the IEEE Digital Library. -== How to Submit ==- Both types of papers have to be maximum 5 pages long (including bibliography and annexes). Submissions must be submitted online via the VISSOFT 2015 EasyChair Please adhere to the formatting instruction published on the ICSME -== Organizing Committee ==- General Chair: Program Co-Chairs: NIER/Tool Co-Chairs: NIER/Tool Program Committee: Bilal Alsallakh TU Vienna, Austria By craiganslow at 2015-06-15 10:13 | LtU Forum | login or register to post comments | other blogs | 2838 reads
Symbol Flux: abstract visual debugginghttp://symbolflux.com/projects/avd. Abstract: Do you ever wish you could just see some table or tree (or graph, list or hashmap) while programming? I want to be able to do that all the time, without having to work for it. So, I'm writing an 'abstract visual debugger' to that end, and this is what it looks like so far: XKCD on type theory...http://xkcd.com/1537/ Just thought people might find this amusing. The hell of this is I can tell exactly which languages he's making fun of in almost 75% of those lines. Edit: I would use the "embedding url" with an html tag containing img=http://imgs.xkcd.com/comics/types.png but LTU refuses to display it. Functors are Type Refinement SystemsFunctors are Type Refinement Systems
This paper was quite a joy to read. The proposed framework feels simple yet penetrating, with convincing examples of elementary categorical constructions translating to non-trivial type system features. According to the second author, it is only the first in a series, with a much more advanced second one already available as a draft on the arXiv; I hope that this develops into a useful foundational setting for programming languages. Structuring F# Programs with Abstract Data Types [Presentation on Vimeo]I'm hoping this presentation about structuring functional programs could generate some interesting discussion here :) I gave this talk at the New York City F# meetup not too long ago. Synopsis: A question many people who are new to functional programming ask is, "what does a functional program look like?" Of course, they're not asking about the appearance of individual functions. Instead they are asking what the structure of a functional program should look like, in the abstract. And further, how to go about building one. This talk presents a powerful, composable, and general means of building well-structured functional programs, specifically in F#. Presented is a singular, simple functional 'design pattern' that can be applied recursively to architect principled F# programs. Like any pattern, it's applicability is not total. However, for those looking start architecting beautiful functional programs, frameworks, and engines in F#, this is a great first approach to consider. Check it out here. Slides and examples are also available here. By bryanedds at 2015-06-08 17:55 | LtU Forum | login or register to post comments | other blogs | 3479 reads
|
Browse archives
Active forum topics |
Recent comments
8 weeks 1 day ago
8 weeks 2 days ago
8 weeks 2 days ago
8 weeks 3 days ago
8 weeks 6 days ago
8 weeks 6 days ago
9 weeks 14 hours ago
9 weeks 18 hours ago
9 weeks 19 hours ago
9 weeks 19 hours ago