American School of Paris

The American School of Paris (ASP), established in 1946, is a coeducational, independent international school in Saint-Cloud, France, in the Paris metropolitan area.

American School of Paris
Address
American School of Paris
American School of Paris
41, Rue Pasteur, 92210 Saint-Cloud

France
Coordinates48.8406°N 2.1961°E / 48.8406; 2.1961
Information
TypeInternational school
Established1946
Head of schoolJane Thompson
Faculty196
GradesPre-K–12
Enrollment814
MascotLafayette
AffiliationIndependent
Websitewww.asparis.org

The school has over 800 students from pre-kindergarten to Grade 12 and post-Bac. Located on a private 10.5 acre (40,000+ m2) campus on the edge of Paris, ASP provides an American education to an international student body of more than 50 nationalities.

School overview

ASP is organized into three divisions: Lower School (Early Childhood through Grade 5, or 3-10 years old), Middle School (Grades 6-8, or ages 11-13) and Upper School (Grades 9-12 and post-Bac, or 14-18 years old). Approximately one-third of the students are American, and 17% are French. The other half of the students come from over 50 countries.[1]

Approximately 75% of students are expatriates with parents serving diplomatic or corporate posts in the Paris region. ASP offers a transportable education, thus students are able to transition from and to schools in the United States and elsewhere with little disruption.

Class sizes are small, and except for foreign language courses, are delivered in English. ASP accepts students who do not speak English up to the age of 8 and has extensive support programs for English as an Additional Language (EAL) learning for those students, as well as other support services for students from age 3 to Grade 12. ASP graduates matriculate at colleges and universities in the USA and around the world. [2]

gollark: MUAHAHAHAHA, my code compiles.
gollark: osmarkslisp™ just has `let` and `lambda`.
gollark: Real programmers use osmarkslisp™.
gollark: ```lisp (let (qsort xs cont) (cond ((= xs '()) (cont '())) (true (do (let h (head xs)) (let t (tail xs)) (let part_result (partition_rec t (lambda (x) (< x h)) '(() ()))) (qsort (head part_result) (lambda (ls) (qsort (snd part_result) (lambda (rs) (cont (+ ls (list h) rs)))))) )) ))```↑ provably optimal sorting algorithm
gollark: Well, in Haskell you would just use the highly efficient quicksort from somewhere.

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.