SCOPUS 정보 검색 플랫폼

Volumn 79, Issue 4, 2001, Pages 197-201

The generic approximation lemma

Author keywords

Functional programming; Programming calculi

Indexed keywords

DATA REDUCTION; DATA STRUCTURES; MATHEMATICAL PROGRAMMING; THEOREM PROVING;

GENERIC APPROXIMATION LEMMA;

APPROXIMATION THEORY;

EID: 0035882587 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/S0020-0190(00)00220-9 Document Type: Article

Times cited : (12)

References (10)

1
- 0002579534
- Generic programming: An introduction
- D. Swierstra, P. Henriques, J. Oliveira (Eds.), Advanced Functional Programming, Springer, Berlin
- (1999) Lecture Notes in Comput. Sci. , vol.1608 , pp. 28-115
- Backhouse, R.¹ Jansson, P.² Jeuring, J.³ Meertens, L.⁴

4
- 0003552736
- Prentice-Hall, Englewood Cliffs, NJ
- (1980) Mathematical Theory of Program Correctness
- De Bakker, J.¹

5
- 17144404454
- Technical Report 91-4, Centre for Mathematics and Computer Science (CWI), Amsterdam
- (1991) Program calculation properties of continuous algebras
- Fokkinga, M.¹ Meijer, E.²

6
- 0004632481
- Proof methods for structured corecursive programs
- Stirling, Scotland, August
- (1999) Proc. 1st Scottish Functional Programming Workshop
- Gibbons, J.¹ Hutton, G.²

7
- 4243722287
- Bisimilarity as a theory of functional programming
- Aarhus University
- (1995) BRICS Notes Series , vol.NS-95-3
- Gordon, A.¹

8
- 85014115727
- Functional programming with bananas, lenses, envelopes and barbed wire
- J. Hughes (Ed.), Proc. Conference on Functional Programming and Computer Architecture, Springer, Berlin
- (1991) Lecture Notes in Comput. Sci. , vol.523
- Meijer, E.¹ Fokkinga, M.² Paterson, R.³

10
- 0000874096
- The category theoretic solution of recursive domain equations
- (1982) SIAM J. Comput. , pp. 761-783
- Smyth, M.B.¹ Plotkin, G.D.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.