Sciweavers

169 search results - page 21 / 34
» A type system for well-founded recursion
Sort
View
CORR
2000
Springer
138views Education» more  CORR 2000»
13 years 7 months ago
Towards rule-based visual programming of generic visual systems
This paper illustrates how the diagram programming language DIAPLAN can be used to program visual systems. DIAPLAN is a visual rulebased language that is founded on the computation...
Berthold Hoffmann, Mark Minas
ICALP
1990
Springer
13 years 11 months ago
Static Correctness of Hierarchical Procedures
A system of hierarchical, fully recursive types in a truly imperative language allows program fragments written for small types to be reused for all larger types. To exploit this ...
Michael I. Schwartzbach
POPL
2006
ACM
14 years 8 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
CADE
2010
Springer
13 years 8 months ago
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
Brigitte Pientka, Joshua Dunfield
ENTCS
2007
85views more  ENTCS 2007»
13 years 7 months ago
Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...
Emanuel Kitzelmann, Ute Schmid