Result 1 to 16 of 16 total
Systematic abstraction of abstract machines. (English)
J. Funct. Program. 22, No. 4-5, 705-746 (2012).
1
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi. (English)
Inf. Comput. 208, No. 3, 276-291 (2010).
2
Fighting bit rot with types (Experience report: Scala collections). (English)
Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15‒17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPICS ‒ Leibniz International Proceedings in Informatics 4, 427-451, electronic only (2009).
3
A syntactic approach to combining functional notation, lazy evaluation, and higher-order in LP systems. (English)
Hagiya, Masami (ed.) et al., Functional and logic programming. 8th international symposium, FLOPS 2006, Fuji-Susono, Japan, April 24‒26, 2006. Proceedings. Berlin: Springer (ISBN 3-540-33438-6/pbk). Lecture Notes in Computer Science 3945, 146-162 (2006).
4
The Kell calculus: A family of higher-order distributed process calculi. (English)
Priami, Corrado (ed.) et al., Global computing. IST/FET international workshop, GC 2004, Rovereto, Italy, March 9‒12, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-24101-9/pbk). Lecture Notes in Computer Science 3267, 146-178 (2005).
5
A type system for the push-enter model. (English)
Inf. Process. Lett. 87, No. 4, 205-211 (2003).
6
Categorical logic and type theory. (English)
Studies in Logic and the Foundations of Mathematics. 141. Amsterdam: Elsevier. xviii, 760 p. \$ 187.00 (1999).
7
Definitional interpreters for higher-order programming languages. (English)
High.-Order Symb. Comput. 11, No.4, 363-397 (1998).
8
A type-based escape analysis for functional languages. (English)
J. Funct. Program. 8, No.3, 239-273 (1998).
9
On negation in HiLog. (English)
J. Log. Program. 18, No.1, 27-53 (1994).
10
A co-induction principle for recursively defined domains. (English)
Theor. Comput. Sci. 124, No.2, 195-219 (1994).
11
A formalism for the specification of essentially-algebraic structures in 2-categories. (English)
Math. Struct. Comput. Sci. 2, No.1, 1-28 (1992).
12
Constructive mathematics and computer-assisted reasoning systems. (English)
Mathematical logic, Proc. Summer Sch. Conf. Ded. 90th Anniv. Arend Heyting, Chaika/Bulg. 1988, 43-52 (1990).
13
Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs. (English)
Mathematical foundations of computer science, Proc. 12th Symp., Bratislava/Czech. 1986, Lect. Notes Comput. Sci. 233, 177-198 (1986).
14
A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction. (English)
J. Symb. Comput. 1, 323-328 (1985).
15
Transformations and reduction strategies for typed lambda expressions. (English)
ACM Trans. Program. Lang. Syst. 6, 603-631 (1984).
16
Result 1 to 16 of 16 total
Start
Contact
Print
General Help
