Result 1 to 20 of 170 total
Generic multiset programming with discrimination-based joins and symbolic Cartesian products. (English)
High.-Order Symb. Comput. 23, No. 3, 337-370 (2010).
1
Making “stricterness” more relevant. (English)
High.-Order Symb. Comput. 23, No. 3, 315-335 (2010).
2
Context-sensitive analysis without calling-context. (English)
High.-Order Symb. Comput. 23, No. 3, 275-313 (2010).
3
{\sc Mnemonics}: type-safe bytecode generation at run time. (English)
High.-Order Symb. Comput. 23, No. 3, 371-407 (2010).
4
A lean specification for gadts: System F with first-class equality proofs. (English)
High.-Order Symb. Comput. 23, No. 2, 145-166 (2010).
5
Hume box calculus: Robust system development through software transformation. (English)
High.-Order Symb. Comput. 23, No. 2, 191-226 (2010).
6
Space-efficient gradual typing. (English)
High.-Order Symb. Comput. 23, No. 2, 167-189 (2010).
7
Keeping calm in the face of change. Towards optimisation of FRP by reasoning about change. (English)
High.-Order Symb. Comput. 23, No. 2, 227-271 (2010).
8
Linearity and iterator types for Gödel’s system $\mathcal T$. (English)
High.-Order Symb. Comput. 23, No. 1, 1-27 (2010).
9
The two variable per inequality abstract domain. (English)
High.-Order Symb. Comput. 23, No. 1, 87-143 (2010).
10
Magic-sets for localised analysis of Java bytecode. (English)
High.-Order Symb. Comput. 23, No. 1, 29-86 (2010).
11
Special issue: PEPM 2010, ACM SIGPLAN 2010 workshop on partial evaluation and program manipulation, Madrid, Spain, January 18‒19, 2010. Selected papers. (English)
High.-Order Symb. Comput. 23, No. 3, 273-407 (2010).
12
A principled approach to programming with nested types in Haskell. (English)
High.-Order Symb. Comput. 22, No. 2, 155-189 (2009).
13
A minimalistic look at widening operators. (English)
High.-Order Symb. Comput. 22, No. 2, 145-154 (2009).
14
Directly reflective meta-programming. (English)
High.-Order Symb. Comput. 22, No. 2, 115-144 (2009).
15
Calculations. (English)
High.-Order Symb. Comput. 22, No. 4, 333-359 (2009).
16
Stories about calculations: Remembering Peter Landin. (English)
High.-Order Symb. Comput. 22, No. 4, 331-332 (2009).
17
Getting rid of labels. (English)
High.-Order Symb. Comput. 22, No. 4, 315-329 (2009).
18
An introduction to Landin’s “Getting rid of labels”. (English)
High.-Order Symb. Comput. 22, No. 4, 313-314 (2009).
19
The Peter Landin prize. (English)
High.-Order Symb. Comput. 22, No. 4, 305-312 (2009).
20
Result 1 to 20 of 170 total
Start
Contact
Print
General Help
