Sciweavers

686 search results - page 28 / 138
» Foundations for Bidirectional Programming
Sort
View
ICFP
2000
ACM
15 years 2 months ago
Intersection types and computational effects
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
Rowan Davies, Frank Pfenning
ENTCS
2008
75views more  ENTCS 2008»
14 years 9 months ago
Focusing the Inverse Method for LF: A Preliminary Report
In this paper, we describe a proof-theoretic foundation for bottom-up logic programming based on uniform proofs in the setting of the logical framework LF. We present a forward un...
Brigitte Pientka, Xi Li, Florent Pompigne
PEPM
2007
ACM
15 years 3 months ago
The semantics of graphical languages
Visual notations are pervasive in circuit design, control systems, and increasingly in mainstream programming environments. Yet many of the foundational advances in programming la...
Stephan Ellner, Walid Taha
64
Voted
ICFP
2006
ACM
15 years 9 months ago
Boxy types: inference for higher-rank types and impredicativity
Languages with rich type systems are beginning to employ a blend of type inference and type checking, so that the type inference engine is guided by programmer-supplied type annot...
Dimitrios Vytiniotis, Stephanie Weirich, Simon L. ...
CADE
2008
Springer
15 years 10 months ago
Collaborative Programming: Applications of Logic and Automated Reasoning
Collaborative Programming is characterized by groups of people issuing instructions to computer systems. Collaborative Programming languages differ from traditional programming lan...
Timothy L. Hinrichs