User loginNavigation |
archivesCompetitive Collaborative Specification of GUI Applications through User Test Cases and Merit-Based Conflict Resolution
Now that we have considered how users can help each other avoid bugs in GUI applications, we would look to think about ways in which users can have more control in software development.
One idea is to develop a system to help millions of users collaboratively build and evolve a specification for a GUI app. For example, how would a million users specify a paragraph formatting dialog box? How would a million users specify the behavior of the cursor in a scientific word processor with math formulas, tables, etc.? Some issues:
Differentiating Data Structures
This paper was mentioned here before, but not on the home page.
It deserves to get more attention, since it is quite cool. Warning: This one isn't for the faint of heart, and uses scary terms like polynomial functors, initial algebras and terminal coalgebras, constructive set theory and more... By Ehud Lamm at 2005-05-26 10:53 | Category Theory | Functional | 5 comments | other blogs | 12215 reads
Lisp or ErlangSome here will find this discussion on language choice for building an industrial strength poker server to be of interest. PLT Needs You!PLT needs your help. From the mailing list:
The deadline for letters of support is 1 July 2005. Context Free: Grammars as Graphics
I'm pleased to announce the 1.0 release of Context Free: an environment for writing and rendering graphic design grammars for Mac OS X, Windows and Posix/Unix.
In Context Free, you write a context free grammar where the only two terminals are the shapes CIRCLE and SQUARE. Given a starting symbol, the program keeps expanding symbols that have rules until all that is left are terminal shapes, which are then drawn. In essence, the rendered images are legal sentences in the language described by your grammar! Context Free is based on Chris Coyne's earlier CFDG, mentioned on LtU in the Fun department. Generics: The Importance of Wildcards
Martin Bravenboer writes about generic wildcards in Java, and concludes that it is unfortunate that C# will not support wildcards or a similar mechanism.
Eric Gunnerson from Microsoft replies. I was originally a type-erasure fan, but these days I am not so sure. I hope this turns into a fruitful discussion that helps me decide... P.S The Java paper was mentioned on LtU before. By Ehud Lamm at 2005-05-26 20:05 | Software Engineering | Type Theory | 14 comments | other blogs | 14233 reads
Data flow analysis on functional LanguageHi everyone, I need to perform a data flow analysis on a lamda-calculus like functional language. Ideally, this should be a type-based approach. Can anyone on this forum direct me a mean to do this. What is particularly troublesome is that a data flow analysis naturally necessitates a fix-point analysis which is done recursively on the structure of the program whereas a type analysis is done in one pass over the program. I would be grateful for any insight anyone might have to help me solve this problem. R.K. |
Browse archivesActive forum topics |
Recent comments
22 weeks 7 hours ago
22 weeks 11 hours ago
22 weeks 11 hours ago
44 weeks 1 day ago
48 weeks 3 days ago
50 weeks 19 hours ago
50 weeks 19 hours ago
1 year 4 days ago
1 year 5 weeks ago
1 year 5 weeks ago