Result 1 to 20 of 87 total
Classical call-by-need sequent calculi: the unity of semantic artifacts. (English)
Schrijvers, Tom (ed.) et al., Functional and logic programming. 11th international symposium, FLOPS 2012, Kobe, Japan, May 23‒25, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29821-9/pbk). Lecture Notes in Computer Science 7294, 32-46 (2012).
1
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation. (English)
Ann. Pure Appl. Logic 163, No. 2, 122-131 (2012).
2
Modular natural language processing using declarative attribute grammars. (English)
Batyrshin, Ildar (ed.) et al., Advances in artificial intelligence. 10th Mexican international conference on artificial intelligence, MICAI 2011, Puebla, Mexico, November 26‒December 4, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-25323-2/pbk). Lecture Notes in Computer Science 7094. Lecture Notes in Artificial Intelligence, 291-304 (2011).
3
Lazy productivity via termination. (English)
Theor. Comput. Sci. 412, No. 28, 3203-3225 (2011).
4
Classical call-by-need and duality. (English)
Ong, Luke (ed.), Typed lambda calculi and applications. 10th international conference, TLCA 2011, Novi Sad, Serbia, June 1‒3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21690-9/pbk; 978-3-642-21691-6/ebook). Lecture Notes in Computer Science 6690, 27-44 (2011).
5
A generic lazy evaluation scheme for exact geometric computations. (English)
Sci. Comput. Program. 76, No. 4, 307-323 (2011).
6
Making “stricterness” more relevant. (English)
High.-Order Symb. Comput. 23, No. 3, 315-335 (2010).
7
Imperative abstractions for functional actions. (English)
J. Log. Algebr. Program. 79, No. 8, 768-793 (2010).
8
Lazy combinators for executable specifications of general attribute grammars. (English)
Carro, Manuel (ed.) et al., Practical aspects of declarative languages. 12th international symposium, PADL 2010, Madrid, Spain, January 18‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11502-8/pbk). Lecture Notes in Computer Science 5937, 167-182 (2010).
9
On-demand strategy annotations revisited: an improved on-demand evaluation strategy. (English)
Theor. Comput. Sci. 411, No. 2, 504-541 (2010).
10
Derivation in scattered context grammar via lazy function evaluation. (English)
Hlinený, Petr (ed.) et al., Annual doctoral workshop on mathematical and engineering methods in computer science (MEMICS’09). Selected papers based on the presentations at the workshop, November 13-15, 2009, Znojmo, Czech Republic. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-15-6). OASIcs ‒ OpenAccess Series in Informatics 13, 27-36, electronic only (2009).
11
Fast construction of constant bound functions for sparse polynomials. (English)
J. Glob. Optim. 43, No. 2-3, 445-458 (2009).
12
Improving the lazy Krivine machine. (English)
High.-Order Symb. Comput. 20, No. 3, 271-293 (2007).
13
Explaining the lazy Krivine machine using explicit substitution and addresses. (English)
High.-Order Symb. Comput. 20, No. 3, 257-270 (2007).
14
Flow analysis of lazy higher-order functional programs. (English)
Theor. Comput. Sci. 375, No. 1-3, 120-136 (2007).
15
Kleene getting lazy. (English)
Sci. Comput. Program. 65, No. 2, 195-214 (2007).
16
Exact admission-control for integrated aperiodic and periodic tasks. (English)
J. Comput. Syst. Sci. 73, No. 2, 225-241 (2007).
17
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).
18
From eager $\Cal {PFL}$ to lazy Haskell. (English)
Comput. Inform. 25, No. 1, 61-80 (2006).
19
PSEUDO: applications of streams and lazy evaluation to integrable models. (English)
Comput. Phys. Commun. 163, No. 1, 22-40 (2004).
20
Result 1 to 20 of 87 total
Start
Contact
Print
General Help
